{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:E4TSHGPCFGVUVUIWRCD2VQGDJ2","short_pith_number":"pith:E4TSHGPC","schema_version":"1.0","canonical_sha256":"27272399e229ab4ad1168887aac0c34e880760c485e704a9e33ce0b58ac7e632","source":{"kind":"arxiv","id":"2003.03485","version":1},"attestation_state":"computed","paper":{"title":"Neural Operator: Graph Kernel Network for Partial Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A single set of network parameters can describe mappings between infinite-dimensional spaces and their finite approximations using graph kernel networks.","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Stuart, Anima Anandkumar, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Nikola Kovachki, Zongyi Li","submitted_at":"2020-03-07T01:56:20Z","abstract_excerpt":"The classical development of neural networks has been primarily for mappings between a finite-dimensional Euclidean space and a set of classes, or between two finite-dimensional Euclidean spaces. The purpose of this work is to generalize neural networks so that they can learn mappings between infinite-dimensional spaces (operators). The key innovation in our work is that a single set of network parameters, within a carefully designed network architecture, may be used to describe mappings between infinite-dimensional spaces and between different finite-dimensional approximations of those spaces"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2003.03485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-07T01:56:20Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"a134ca4c27e49f81d72f760c4201ce7d598edec990ecca9c23d046cf4c9de232","abstract_canon_sha256":"26201da04c09f76f2fb8b3a3f189e55fb309433aa9f8feb44b6e922aef41479c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:21.493464Z","signature_b64":"qbvF8/fM6x9PLr2mJVSVejXimcA2Nb4s8RZnN1dyWT29ZoO8tpoaYYqzQerAIAKe73XFDaO3iVkT8lusLectCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27272399e229ab4ad1168887aac0c34e880760c485e704a9e33ce0b58ac7e632","last_reissued_at":"2026-05-17T23:39:21.492591Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:21.492591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Operator: Graph Kernel Network for Partial Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A single set of network parameters can describe mappings between infinite-dimensional spaces and their finite approximations using graph kernel networks.","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Stuart, Anima Anandkumar, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Nikola Kovachki, Zongyi Li","submitted_at":"2020-03-07T01:56:20Z","abstract_excerpt":"The classical development of neural networks has been primarily for mappings between a finite-dimensional Euclidean space and a set of classes, or between two finite-dimensional Euclidean spaces. The purpose of this work is to generalize neural networks so that they can learn mappings between infinite-dimensional spaces (operators). The key innovation in our work is that a single set of network parameters, within a carefully designed network architecture, may be used to describe mappings between infinite-dimensional spaces and between different finite-dimensional approximations of those spaces"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A single set of network parameters, within a carefully designed network architecture, may be used to describe mappings between infinite-dimensional spaces and between different finite-dimensional approximations of those spaces.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That message passing on graphs can faithfully approximate the required integral operators for the target PDE mappings without introducing discretization-dependent artifacts that break generalization.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Graph Kernel Networks learn PDE solution operators that generalize across discretization methods and grid resolutions using graph-based kernel integration.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A single set of network parameters can describe mappings between infinite-dimensional spaces and their finite approximations using graph kernel networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e5e6833e714884f08fc95423b8a07bb3df63a1f21c0311209370258b8fc6ed80"},"source":{"id":"2003.03485","kind":"arxiv","version":1},"verdict":{"id":"186e514a-8a15-49cb-8c39-1e283d135728","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T22:13:20.539096Z","strongest_claim":"A single set of network parameters, within a carefully designed network architecture, may be used to describe mappings between infinite-dimensional spaces and between different finite-dimensional approximations of those spaces.","one_line_summary":"Graph Kernel Networks learn PDE solution operators that generalize across discretization methods and grid resolutions using graph-based kernel integration.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That message passing on graphs can faithfully approximate the required integral operators for the target PDE mappings without introducing discretization-dependent artifacts that break generalization.","pith_extraction_headline":"A single set of network parameters can describe mappings between infinite-dimensional spaces and their finite approximations using graph kernel networks."},"references":{"count":141,"sample":[{"doi":"10.1137/07070111x","year":2009,"title":"Kolda and Brett W","work_id":"00b6411a-bd17-4725-9d1c-60a55cd201b5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Hsu and Sham M","work_id":"0bca2428-01fc-484e-8b9b-57e0ae50249b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/090752286","year":2011,"title":"Tensor-train decomposition","work_id":"880f1684-5487-419a-885a-823cf8b643c4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Fast adaptive interpolation of multi-dimensional arrays in tensor train format , isbn =","work_id":"c3ef5637-48d5-4929-a1d6-233d247e9e96","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Gorodetsky and Sertac Karaman and Youssef M","work_id":"e4c45c80-38b9-445a-83ba-205f1910fbc7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":141,"snapshot_sha256":"f7789c609d414f0db2016e8242d8b48e843f3951c6aa40f44745ab3d709ebc3e","internal_anchors":16},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb2252c5ab474b3359f68b4c90dac6b7e167f0a9e5dcb53de459f27eb7ebdcdf"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.03485","created_at":"2026-05-17T23:39:21.492754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.03485v1","created_at":"2026-05-17T23:39:21.492754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03485","created_at":"2026-05-17T23:39:21.492754+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4TSHGPCFGVU","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4TSHGPCFGVUVUIW","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4TSHGPC","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":40,"internal_anchor_count":40,"sample":[{"citing_arxiv_id":"2302.03286","citing_title":"Algorithmically Designed Artificial Neural Networks (ADANNs): Higher order deep operator learning for parametric partial differential equations","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2305.14703","citing_title":"Generative diffusion learning for parametric partial differential equations","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2407.00809","citing_title":"Kernel Neural Operators (KNOs) for Scalable, Memory-efficient, Geometrically-flexible Operator Learning","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2410.06074","citing_title":"Scalable Mechanistic Neural Networks for Differential Equations and Machine Learning","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2511.07347","citing_title":"Walsh-Hadamard Neural Operators for Solving PDEs with Discontinuous Coefficients","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23937","citing_title":"Multi-scale Dynamic Wake Modeling and Prediction of Floating Offshore Wind Turbines via Physics-Informed Neural Networks and Fourier Neural Operators","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19959","citing_title":"Learning Orthonormal Bases for Function Spaces","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15881","citing_title":"Symplectic Neural Operators for Learning Infinite Dimensional Hamiltonian Systems","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15754","citing_title":"Spatiotemporal decoupled physics-informed Stone-Weierstrass neural operator for long-time prediction of time-dependent parametric PDEs","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2506.07969","citing_title":"A Two-Phase Deep Learning Framework for Adaptive Time-Stepping in High-Speed Flow Modeling","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2507.21437","citing_title":"PVD-ONet: A Multi-scale Neural Operator Method for Singularly Perturbed Boundary Layer Problems","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2509.00203","citing_title":"Estimating Parameter Fields in Multi-Physics PDEs from Scarce Measurements","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03738","citing_title":"Mechanistic Interpretability with Sparse Autoencoder Neural Operators","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2509.12344","citing_title":"FEDONet : Fourier-Embedded DeepONet for Spectrally Accurate Operator Learning","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02481","citing_title":"NOWS: Neural Operator Warm Starts for Accelerating Iterative Solvers","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2512.13197","citing_title":"Parameter-Efficient Transfer Learning for Microseismic Phase Picking Using a Neural Operator","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2512.23192","citing_title":"PGOT: A Physics-Geometry Operator Transformer for Complex PDEs","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2402.02366","citing_title":"Transolver: A Fast Transformer Solver for PDEs on General Geometries","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14546","citing_title":"Discovering Physical Directions in Weight Space: Composing Neural PDE Experts","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14137","citing_title":"Flow Field Reconstruction with Sensor Placement Policy Learning","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12965","citing_title":"U-HNO: A U-shaped Hybrid Neural Operator with Sparse-Point Adaptive Routing for Non-stationary PDE Dynamics","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13790","citing_title":"Di-BiLPS: Denoising induced Bidirectional Latent-PDE-Solver under Sparse Observations","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02483","citing_title":"A Multimodal Vision Transformer-based Modeling Framework for Prediction of Fluid Flows in Energy Systems","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12343","citing_title":"Neural-Schwarz Tiling for Geometry-Universal PDE Solving at Scale","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27158","citing_title":"Hybrid Fourier Neural Operator-Lattice Boltzmann Method","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2","json":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2.json","graph_json":"https://pith.science/api/pith-number/E4TSHGPCFGVUVUIWRCD2VQGDJ2/graph.json","events_json":"https://pith.science/api/pith-number/E4TSHGPCFGVUVUIWRCD2VQGDJ2/events.json","paper":"https://pith.science/paper/E4TSHGPC"},"agent_actions":{"view_html":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2","download_json":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2.json","view_paper":"https://pith.science/paper/E4TSHGPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.03485&json=true","fetch_graph":"https://pith.science/api/pith-number/E4TSHGPCFGVUVUIWRCD2VQGDJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/E4TSHGPCFGVUVUIWRCD2VQGDJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2/action/storage_attestation","attest_author":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2/action/author_attestation","sign_citation":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2/action/citation_signature","submit_replication":"https://pith.science/pith/E4TSHGPCFGVUVUIWRCD2VQGDJ2/action/replication_record"}},"created_at":"2026-05-17T23:39:21.492754+00:00","updated_at":"2026-05-17T23:39:21.492754+00:00"}