{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T12:07:17Z","timestamp":1779278837258,"version":"3.51.4"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jocs.2026.102874","type":"journal-article","created":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T14:35:07Z","timestamp":1776177307000},"page":"102874","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["SGRDN-Data learned sparsification of graph reaction\u2013diffusion networks"],"prefix":"10.1016","volume":"97","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4837-8980","authenticated-orcid":false,"given":"Abhishek","family":"Ajayakumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumyendu","family":"Raha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jocs.2026.102874_b1","series-title":"Reducing Down(stream)time: Pretraining Molecular GNNs using Heterogeneous AI Accelerators","author":"Bilbrey","year":"2022"},{"key":"10.1016\/j.jocs.2026.102874_b2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.jcp.2017.11.039","article-title":"Hidden physics models: Machine learning of nonlinear partial differential equations","volume":"357","author":"Raissi","year":"2018","journal-title":"J. Comput. Phys."},{"key":"10.1016\/j.jocs.2026.102874_b3","series-title":"Multistep neural networks for data-driven discovery of nonlinear dynamical systems","author":"Raissi","year":"2018"},{"key":"10.1016\/j.jocs.2026.102874_b4","series-title":"PDE-Net: Learning PDEs from Data","author":"Long","year":"2017"},{"key":"10.1016\/j.jocs.2026.102874_b5","series-title":"Latent-space physics: Towards learning the temporal evolution of fluid flow","author":"Wiewel","year":"2019"},{"key":"10.1016\/j.jocs.2026.102874_b6","doi-asserted-by":"crossref","unstructured":"David R. Karger, Random sampling in cut, flow, and network design problems, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of computing - STOC \u201994, 1994.","DOI":"10.1145\/195058.195422"},{"issue":"2","key":"10.1016\/j.jocs.2026.102874_b7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.24.2.383","article-title":"Random sampling in cut, flow, and network design problems","volume":"24","author":"Karger","year":"1999","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.jocs.2026.102874_b8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1137\/070705970","article-title":"Randomized approximation schemes for cuts and flows in capacitated graphs","volume":"44","author":"Bencz\u00far","year":"2015","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jocs.2026.102874_b9","unstructured":"Andr\u00e1s A. Bencz\u00far, David R. Karger, Approximating S-T minimum cuts in 00D5(N2) time, in: Proceedings of the Twenty-Eighth Annual ACM symposium on Theory of Computing - STOC \u201996, 1996."},{"key":"10.1016\/j.jocs.2026.102874_b10","unstructured":"Kook Jin Ahn, Sudipto Guha, Andrew McGregor, Graph sketches, in: Proceedings of the 31st Symposium on Principles of Database Systems - PODS \u201912, 2012."},{"issue":"4","key":"10.1016\/j.jocs.2026.102874_b11","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1137\/08074489X","article-title":"Spectral sparsification of graphs","volume":"40","author":"Spielman","year":"2011","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jocs.2026.102874_b12","doi-asserted-by":"crossref","unstructured":"Daniel A. Spielman, Shang-Hua Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of computing - STOC \u201904, 2004.","DOI":"10.1145\/1007352.1007372"},{"key":"10.1016\/j.jocs.2026.102874_b13","doi-asserted-by":"crossref","unstructured":"Daniel A. Spielman, Nikhil Srivastava, Graph sparsification by effective resistances, in: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, 2008.","DOI":"10.1145\/1374376.1374456"},{"key":"10.1016\/j.jocs.2026.102874_b14","doi-asserted-by":"crossref","unstructured":"Navin Goyal, Luis Rademacher, Santosh Vempala, Expanders via random spanning trees, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009.","DOI":"10.1137\/1.9781611973068.64"},{"issue":"2","key":"10.1016\/j.jocs.2026.102874_b15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/130949117","article-title":"Twice-ramanujan sparsifiers","volume":"56","author":"Batson","year":"2014","journal-title":"SIAM Rev."},{"key":"10.1016\/j.jocs.2026.102874_b16","series-title":"Graph Sparsification by Edge-Connectivity and Random Spanning Trees","author":"Fung","year":"2010"},{"key":"10.1016\/j.jocs.2026.102874_b17","unstructured":"Guihong Wan, Haim Schweitzer, Edge sparsification for graphs via meta-learning, in: 2021 IEEE 37th International Conference on Data Engineering, ICDE, 2021."},{"issue":"4","key":"10.1016\/j.jocs.2026.102874_b18","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1038\/s41567-018-0409-0","article-title":"Spatiotemporal signal propagation in complex networks","volume":"15","author":"Hens","year":"2019","journal-title":"Nat. Phys."},{"issue":"1","key":"10.1016\/j.jocs.2026.102874_b19","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-018-34372-0","article-title":"Pattern invariance for reaction-diffusion systems on complex networks","volume":"8","author":"Cencetti","year":"2018","journal-title":"Sci. Rep."},{"key":"10.1016\/j.jocs.2026.102874_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.ecocom.2021.100948","article-title":"Stability aware spatial cut of metapopulations ecological networks","volume":"47","author":"Kumar","year":"2021","journal-title":"Ecol. Complex."},{"issue":"5361","key":"10.1016\/j.jocs.2026.102874_b21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1038\/238229a0","article-title":"The fourth law of thermodynamics","volume":"238","author":"Landsberg","year":"1972","journal-title":"Nature"},{"key":"10.1016\/j.jocs.2026.102874_b22","series-title":"Dynamic Data Assimilation: A Least Squares Approach","author":"Lewis","year":"2009"},{"key":"10.1016\/j.jocs.2026.102874_b23","series-title":"Bayesian Filtering and Smoothing","author":"Simo","year":"2013"},{"key":"10.1016\/j.jocs.2026.102874_b24","series-title":"Data Assimilation: A Mathematical Introduction","author":"Law","year":"2015"},{"key":"10.1016\/j.jocs.2026.102874_b25","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","article-title":"Relaxation and decomposition methods for mixed integer nonlinear programming","author":"Nowak","year":"2005","journal-title":"Internat. Ser. Numer. Math."},{"issue":"4","key":"10.1016\/j.jocs.2026.102874_b26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0098-1354(85)85014-6","article-title":"Sensitivity analysis of initial value problems with mixed odes and algebraic equations","volume":"9","author":"Caracotsios","year":"1985","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.jocs.2026.102874_b27","series-title":"Nonlinear Parameter Estimation","author":"Bard","year":"1974"},{"issue":"1","key":"10.1016\/j.jocs.2026.102874_b28","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/aic.690320105","article-title":"Nonlinear parameter estimation: A case study comparison","volume":"32","author":"Biegler","year":"1986","journal-title":"AIChE J."},{"issue":"6","key":"10.1016\/j.jocs.2026.102874_b29","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.jlp.2008.07.012","article-title":"Process monitoring and parameter estimation via unscented Kalman filtering","volume":"22","author":"Qu","year":"2009","journal-title":"J. Loss Prev. Process. Ind."},{"key":"10.1016\/j.jocs.2026.102874_b30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2010\/375615","article-title":"Forward sensitivity approach to dynamic data assimilation","volume":"2010","author":"Lakshmivarahan","year":"2010","journal-title":"Adv. Meteorol."},{"key":"10.1016\/j.jocs.2026.102874_b31","series-title":"Numerical Analysis","author":"Burden","year":"2016"},{"issue":"5","key":"10.1016\/j.jocs.2026.102874_b32","doi-asserted-by":"crossref","first-page":"1893","DOI":"10.1137\/S0036142901389049","article-title":"A new look at proper orthogonal decomposition","volume":"41","author":"Rathinam","year":"2003","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.jocs.2026.102874_b33","series-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"10.1016\/j.jocs.2026.102874_b34","series-title":"Efficient calculation of determinants of symbolic matrices with many variables","author":"Khovanova","year":"2013"},{"key":"10.1016\/j.jocs.2026.102874_b35","series-title":"ARPACK users\u2019 guide","author":"Lehoucq","year":"1998"},{"issue":"3","key":"10.1016\/j.jocs.2026.102874_b36","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/S0895479800371529","article-title":"A Krylov\u2013Schur algorithm for large eigenproblems","volume":"23","author":"Stewart","year":"2002","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jocs.2026.102874_b37","series-title":"Perturbation Bounds for Matrix Eigenvalues","author":"Bhatia","year":"2007"},{"issue":"1\u20133","key":"10.1016\/j.jocs.2026.102874_b38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0045-7825(90)90019-I","article-title":"Lax-stability of fully discrete spectral methods via stability regions and pseudo-eigenvalues","volume":"80","author":"Reddy","year":"1990","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"key":"10.1016\/j.jocs.2026.102874_b39","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"2021"},{"issue":"4","key":"10.1016\/j.jocs.2026.102874_b40","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/10556788.2013.858156","article-title":"An interior point method for nonlinear programming with Infeasibility Detection Capabilities","volume":"29","author":"Nocedal","year":"2014","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.jocs.2026.102874_b41","doi-asserted-by":"crossref","unstructured":"Ryan A. Rossi, Nesreen K. Ahmed, The Network Data Repository with Interactive Graph Analytics and Visualization, in: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"10.1016\/j.jocs.2026.102874_b42","series-title":"SNAP Datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"10.1016\/j.jocs.2026.102874_b43","series-title":"MATLAB version: 9.13.0 (r2022b)","author":"The MathWorks Inc","year":"2022"},{"issue":"4","key":"10.1016\/j.jocs.2026.102874_b44","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1002\/rsa.20130","article-title":"A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs","volume":"30","author":"Baswana","year":"2007","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.jocs.2026.102874_b45","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-69689-3_7","article-title":"Chemical turbulence","author":"Kuramoto","year":"1984","journal-title":"Chem. Oscil. Waves Turbul."},{"issue":"2","key":"10.1016\/j.jocs.2026.102874_b46","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/00107514.2011.642554","article-title":"The complex Ginzburg2013Landau equation: An introduction","volume":"53","author":"Garc\u00eda-Morales","year":"2012","journal-title":"Contemp. Phys."},{"key":"10.1016\/j.jocs.2026.102874_b47","series-title":"Neural ordinary differential equations","author":"Chen","year":"2018"}],"container-title":["Journal of Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187775032600092X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187775032600092X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T11:27:47Z","timestamp":1779276467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187775032600092X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":47,"alternative-id":["S187775032600092X"],"URL":"https:\/\/doi.org\/10.1016\/j.jocs.2026.102874","relation":{},"ISSN":["1877-7503"],"issn-type":[{"value":"1877-7503","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"SGRDN-Data learned sparsification of graph reaction\u2013diffusion networks","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jocs.2026.102874","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102874"}}