{"as_of":"2026-08-08T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:880507387d7d124a4f321f908d6cf7ee2703f4006a57575d31ee3b784b02b724","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:20:37.558016Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.08785/citation-record","integrity":"/paper/2602.08785/integrity","json":"/paper/2602.08785/citation-record.json","paper":"/paper/2602.08785"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.363674Z","title":"Trees and amenable equivalence relations.Ergodic Theory and Dynamical Systems, 10(1):1–14, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.363674Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:528137cf9d79b676ac1432303559878ad43ca23284540b7eb41aa2abc68352a7","observation_id":"ea25f641-edd7-4f9d-bce1-1eeccd82342b","resolution":{"observed_at":"2026-08-03T03:20:37.363674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.367309Z","title":"Springer, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.367309Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:97fb94881edd6086cf89a4f3aa47c54ab58d06ff8270493ff71868af27060fd2","observation_id":"cf7be0ce-2143-4fba-9b0c-11595a9f599d","resolution":{"observed_at":"2026-08-03T03:20:37.367309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.370086Z","title":"Characterizing the expressive power of invariant and equivariant graph neural networks.International Conference on Learning Representations, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.370086Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:f1059b66b9c508e277636afa5aae06776f1bef320f529a7b6528af29c5fd0b5d","observation_id":"e7961f17-41eb-4f16-948b-297891cede29","resolution":{"observed_at":"2026-08-03T03:20:37.370086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.373793Z","title":"Action convergence of operators and graphs.Canadian Journal of Mathematics, 74(1):72–121, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.373793Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4c1258db9522d2f532ab1a36d9c346e5cbd3808c11651eabf8d3754a9d426c34","observation_id":"14e5c56a-798d-401e-a665-69d4d63b5fde","resolution":{"observed_at":"2026-08-03T03:20:37.373793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.376604Z","title":"Emergence of scaling in random networks.Science, 286(5439):509–512, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.376604Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:f8a46bce89c3e1dcc3772d2135f534b0596ebb9d5d5dc9db1000ff44f2747e08","observation_id":"60915b35-ce73-43f4-8e85-062902814264","resolution":{"observed_at":"2026-08-03T03:20:37.376604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.379564Z","title":"Probability and measure.A Wiley-Interscience Publica- tion, John Wiley, 118:119, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.379564Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:0f355b80c04eaaf189fc8772dbe391b0ecc4b56e3148e5cccb675d4cd4dc84a0","observation_id":"8e1960ac-da05-4ebb-8d06-10013d51141b","resolution":{"observed_at":"2026-08-03T03:20:37.379564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.382343Z","title":"Springer, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.382343Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:8d94741eee15f5732f6fb638bad65902eeaf6831e808eb6b5c2755d1ee9b722d","observation_id":"67e6f560-815c-4f68-92e0-f09e0440207c","resolution":{"observed_at":"2026-08-03T03:20:37.382343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.384882Z","title":"Fine-grained expressivity of graph neural networks.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.384882Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:33989bf19f602a6110d6c007918ea9d47d402be7e5b11c8a300dc8a5f26d9107","observation_id":"840da83d-5666-4eea-aa9a-a4638719587b","resolution":{"observed_at":"2026-08-03T03:20:37.384882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.387357Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.387357Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:6c123aa505bf90cba48298f0e73bf753e7fa9ec3e4c5c83aac170394920f4364","observation_id":"a7765b99-b944-4b34-b576-faaef1016fdf","resolution":{"observed_at":"2026-08-03T03:20:37.387357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.389997Z","title":"Sparse exchangeable graphs and their limits via graphon processes.Journal of Machine Learning Research, 18(210):1–71, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.389997Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:cb613a15466d196ca8f7e2ad18fe29cbd40d52ca81b60323dd40eb6bcaa6922c","observation_id":"069d9438-a5b7-4816-81c3-54bb867911c7","resolution":{"observed_at":"2026-08-03T03:20:37.389997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.392352Z","title":"An Lp theory of sparse graph convergence ii: Ld convergence, quotients and right convergence.The Annals of Probability, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.392352Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:bba79466bf40c86d0ba01d41da3a8a86991a71dc35b17c3e52ae53cb109c09de","observation_id":"e54c7347-2565-42e5-ab51-1801bb548f1e","resolution":{"observed_at":"2026-08-03T03:20:37.392352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.395453Z","title":"Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing.Advances in Mathematics, 219(6):1801–1851, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.395453Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:42b5f946746b1664ff441005a8f44f718ad5ce25b8c27fd3592341f56bfea631","observation_id":"f3e418ad-9cba-4f99-9b43-ebb4285d1738","resolution":{"observed_at":"2026-08-03T03:20:37.395453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.397980Z","title":"Universal function approximation on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.397980Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:c70cd289e5affd45626f98e848f331c5afb38ca629cc5d6052dfd05e6f1df20a","observation_id":"4cda60a8-a785-4ee4-9964-903b659c1fb2","resolution":{"observed_at":"2026-08-03T03:20:37.397980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.400293Z","title":"American Mathematical Society Providence, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.400293Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:02ab3ec6eeb152bf0eb201ff1498165e0dae1e87afad24685725ed305ae6eca4","observation_id":"1a4adbd0-9b85-43f0-898e-75a8ae331e27","resolution":{"observed_at":"2026-08-03T03:20:37.400293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.402756Z","title":"Monte carlo and quasi-monte carlo methods.Acta numerica, 7:1–49, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.402756Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:059367187f32cb4e7db60738d474fbdf4f2a4fa20651cb64fc3977860d64fa28","observation_id":"99753be4-f5cc-4398-8b92-69a03fb85dc4","resolution":{"observed_at":"2026-08-03T03:20:37.402756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.405054Z","title":"Machine learning on graphs: A model and comprehensive taxonomy","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.405054Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:fae89ef5c4a7e5c305b20bea182580b68341ff3786c3cd56ddc94a80ff37b676","observation_id":"0e3e7fff-c939-40db-a16c-d6ed91c3f1db","resolution":{"observed_at":"2026-08-03T03:20:37.405054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.407538Z","title":"Weisfeiler-lehman meets Gromov-Wasserstein.International Conference on Machine Learning, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.407538Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:e08908827d0bedc7d0603a903e2e41dae5011547a026971595ffb5b755ab46a4","observation_id":"2ffaf536-ccbe-4499-9739-3a103b6c6b09","resolution":{"observed_at":"2026-08-03T03:20:37.407538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.409781Z","title":"On the equiva- lence between graph isomorphism testing and function approximation with gnns.Advances in neural information processing systems, 3, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.409781Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:11b429563d788f4b4df773640f35bd8c8153bd1f8d8e2fffcf3ca4d69fcc9a7b","observation_id":"5c95a2b8-4cfa-43c6-897a-ad70a89e8a54","resolution":{"observed_at":"2026-08-03T03:20:37.409781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.411888Z","title":"Approximation by superpositions of a sigmoidal function","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.411888Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:0297ce095fb8b992ee39804ca9e60d8ebaf0a28373265dfc96b4ab52919b6d31","observation_id":"10072545-6269-48bd-bc96-f2b2ea6a2899","resolution":{"observed_at":"2026-08-03T03:20:37.411888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.414439Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.414439Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:09141c7e878f6568844a3ba26ee41958aea35f359e96abf34f0cd394f4dd847c","observation_id":"8e02670f-8efa-4f00-9348-f9bdc0014786","resolution":{"observed_at":"2026-08-03T03:20:37.414439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.416769Z","title":"John Wiley & Sons, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.416769Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:3195daa0b157e95c0929b3fe0518309346937bc028767f1f731c376d42042a2c","observation_id":"bd701745-5b02-47d4-9af5-5e9d56499c84","resolution":{"observed_at":"2026-08-03T03:20:37.416769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.419342Z","title":"Spaces in which sequences suffice.Fundamenta Mathematicae, 57(1):107–115, 1965","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.419342Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:a6ee1c46632b34f65a2df90b8fd1a6f05e431c428890f8365069fa5a7d03d57f","observation_id":"3641ce7a-bbeb-488e-a963-f2be270288da","resolution":{"observed_at":"2026-08-03T03:20:37.419342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.421765Z","title":"On the approximate realization of continuous mappings by neural networks.Neural networks, 2(3):183–192, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.421765Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:5813e78f0083fed050e08f0056da55a9dad83e9cc09588b2fb2857dbe6638fa1","observation_id":"0bde7086-e08c-47ef-b297-95eb11363914","resolution":{"observed_at":"2026-08-03T03:20:37.421765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.424011Z","title":"A survey of graph neural networks for recommender systems: Challenges, methods, and directions.ACM Transactions on Recommender Systems, 1(1):1–51, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.424011Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:590b440965db29a71d52b87bf48476b23351a2855bc315aed6efc3b195f5c3ae","observation_id":"40dc342e-71b8-41d0-aea7-da45ad557dd1","resolution":{"observed_at":"2026-08-03T03:20:37.424011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.427145Z","title":"Generalization and representational limits of graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.427145Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:c08c9a3863e17e7ba47d074d02857102ad975abe2ef2409c9c95e01003cf5c4d","observation_id":"f8f10de7-eb28-4abf-a03c-a3da0d1f05b7","resolution":{"observed_at":"2026-08-03T03:20:37.427145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.429427Z","title":"Expressiveness and approximation properties of graph neural networks.International Conference on Learning Representations, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.429427Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:2d2cb6143decd0841cdd368ca55d86a5c93050dcf36d65f0ec644ad9be78b0ce","observation_id":"fc254cbb-5b6c-420d-bc85-71e0d563d894","resolution":{"observed_at":"2026-08-03T03:20:37.429427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.431637Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.431637Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:1b5a3490a788b093a6b441642f02365a9a3264dd2d7cbc1d707fefdb49679b30","observation_id":"a5e1a2cd-03d3-4239-9ecf-7d822b725dad","resolution":{"observed_at":"2026-08-03T03:20:37.431637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.434719Z","title":"Fractional isomorphism of graphons.Combi- natorica, 42(3):365–404, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.434719Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:8095e0a342796d259095d98a4028bad5cd50f5253c3e0cb34a84816416a8bc46","observation_id":"3f230ad0-cf03-450a-af25-1575244c3280","resolution":{"observed_at":"2026-08-03T03:20:37.434719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.437165Z","title":"word2vec, node2vec, graph2vec, x2vec: Towards a theory of vector embeddings of structured data","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.437165Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:d0171647a3ffe245bd5814fa5e8f793b54fca5f37aa3c36fc1be4043862c9e2b","observation_id":"52e3fc9f-0512-470d-88d9-2b7b20485c89","resolution":{"observed_at":"2026-08-03T03:20:37.437165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.439398Z","title":"Inductive representation learning on large graphs.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.439398Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:6d50343525bc3c8b30f8fa2a22199e87334f73ae961fc3845b990fb4baab402c","observation_id":"fe277b3d-c30c-4bb6-8ac6-9c3af43c4cb4","resolution":{"observed_at":"2026-08-03T03:20:37.439398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.441737Z","title":"American Mathe- matical Soc., 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.441737Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:1f9913f55b4968ddbba073e534c4b45cdc793ab55cf6e7eaa01835f18a3529e9","observation_id":"b2d1bc84-5090-43d3-80f6-6b7a194bf0dc","resolution":{"observed_at":"2026-08-03T03:20:37.441737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.444045Z","title":"Limits of action convergent graph sequences with un- bounded (p, q)-norms, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.444045Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:d143cc0efa538bc099e30c528128c3cb5edfab113630409dc593c074672a0c6d","observation_id":"ed8a67ea-6d9a-488c-8ea2-7607f98879b6","resolution":{"observed_at":"2026-08-03T03:20:37.444045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08124","last_updated":"2024-03-23T07:40:54Z","snapshot_observed_at":"2026-08-06T12:43:24.806270Z","submitted_at":"2023-12-13T13:24:22Z","title":"Modeling Sparse Graph Sequences and Signals Using Generalized Graphons","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.08124","snapshot_observed_at":"2026-08-03T03:20:37.446338Z","title":"Sparse graph sequences, generalized graphon processes and signal processing.arXiv preprint arXiv:2312.08124, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.446338Z"},"links":{"cited_paper":"/paper/2312.08124","citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:ac8362c30cb64efade25ef51bb2f1a415bf33b02011d088d0c298128b05ca72b","observation_id":"c2802751-865b-4ed2-a112-adf484ef0431","resolution":{"observed_at":"2026-08-03T03:20:37.446338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05260","last_updated":"2023-09-11T06:34:46Z","snapshot_observed_at":"2026-08-05T22:28:48.200153Z","submitted_at":"2023-09-11T06:34:46Z","title":"Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05260","snapshot_observed_at":"2026-08-03T03:20:37.448906Z","title":"Generalized graphon process: Convergence of graph frequencies in stretched cut distance.arXiv preprint arXiv:2309.05260, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.448906Z"},"links":{"cited_paper":"/paper/2309.05260","citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:3ff5953a50ece616892c40249c1009a3b35b3241f34f1ded41e616093df188f0","observation_id":"3947e570-609f-4133-a277-c5e9ac4c0876","resolution":{"observed_at":"2026-08-03T03:20:37.448906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.451505Z","title":"Convolutional neural networks for image classification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.451505Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:788f77820b5b49ff13aeaee6727f0fa51118087a3f319a03b84b23fadb814c4d","observation_id":"285a1204-5d40-4ed6-b728-4f9102f037a8","resolution":{"observed_at":"2026-08-03T03:20:37.451505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.453988Z","title":"Universal invariant and equivariant graph neural networks.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.453988Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:76f2f3913fb20b4155569b1f693d9e241b26ed1ecff45e1f05515314e111254d","observation_id":"cfa006ad-ce64-4443-a974-c086d967c760","resolution":{"observed_at":"2026-08-03T03:20:37.453988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.456456Z","title":"Semi-supervised classification with graph convolutional networks.International Conference on Learning Representa- tions, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.456456Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:171abbeabbcdbff0dd8e1d8f772d3ad3b5eca0d7be5886f0fcf21a3b80d9adf8","observation_id":"2183978b-65dd-49b5-9e5f-178488d854f3","resolution":{"observed_at":"2026-08-03T03:20:37.456456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.458847Z","title":"Lecun, L","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.458847Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:7a029e0268e370617eb82986177cd0cde53d409f309dcb6ab00b737168246980","observation_id":"d9398841-2c14-4dd1-83c7-32dedf54672c","resolution":{"observed_at":"2026-08-03T03:20:37.458847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.461151Z","title":"Multilayer feedforward networks with a nonpolynomial activation function can approximate any function.Neural networks, 6(6):861–867, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.461151Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:855c37346a1f59157f2e74663b0b94a5a3647f512e31868c589c4fcc4d797e9f","observation_id":"54655982-e979-4506-a0fa-d3deb80be0e8","resolution":{"observed_at":"2026-08-03T03:20:37.461151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.463443Z","title":"A graphon-signal analysis of graph neural networks.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.463443Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:138d7298658ba27ed7ff8002dd9fbf670b8fa6293aca83cdda4714d38faadc7d","observation_id":"77ca4471-c937-410c-a421-812ef3fa8ce6","resolution":{"observed_at":"2026-08-03T03:20:37.463443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.465908Z","title":"A pac-bayesian approach to generalization bounds for graph neural networks.International Conference on Learning Representations, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.465908Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:2229004ac8216faa5a93eac6d28d259ab3fe0bd0a0c4130e81882851a3da4b5c","observation_id":"594e5231-1df9-422f-9734-6eac250da907","resolution":{"observed_at":"2026-08-03T03:20:37.465908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.468324Z","title":"American Mathematical Soc., 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.468324Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4270057a007ae8b26e6c7c2cfc816c3c9d496cf159c83cc94857d1f39ffa3f6a","observation_id":"dcfc04f4-cfaf-43d7-a57d-aa8618122df6","resolution":{"observed_at":"2026-08-03T03:20:37.468324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.470572Z","title":"Szemer´ edi’s lemma for the analyst","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.470572Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:79c870afe839d466b7a1481d458accbfc8995e1a395023eb39b7f9caef2a85a1","observation_id":"93c4db8c-692a-4d9c-94c2-21afd1d267d9","resolution":{"observed_at":"2026-08-03T03:20:37.470572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.473031Z","title":"Learning nonlinear operators via deeponet based on the universal approximation theorem of operators.Nature machine intelligence, 3(3):218–229, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.473031Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:88f8515602c4ff1faaa1ae98d2f135651c34e84723b2bf075a782ac56298cdcc","observation_id":"bcdb79ed-e0ed-468f-8bc8-dd4ad816f010","resolution":{"observed_at":"2026-08-03T03:20:37.473031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.475436Z","title":"Generalization bounds for message passing networks on mixture of graphons.SIAM Journal on Mathematics of Data Science, 7(2):802–825, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.475436Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:b304dbb91a7677e5c205a6b4ae07102fd4698e69df6a9e89746ec43614f474ea","observation_id":"34950f59-c086-4bad-85e7-8c33403476d3","resolution":{"observed_at":"2026-08-03T03:20:37.475436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.477630Z","title":"Transferability of graph neural networks: an extended graphon approach.Applied and Computational Harmonic Analysis, 63:48–83, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.477630Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:5c7201fdf05f26d7d5ecb69060f45c4bab03ce3c64ae62b3adc693c8e202ff9e","observation_id":"f34e594d-2b0e-4863-bcd4-a79068fd449c","resolution":{"observed_at":"2026-08-03T03:20:37.477630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.480115Z","title":"Generaliza- tion analysis of message passing neural networks on large random graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.480115Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:2f571ac9ef219f63a26807ba32687eea5775df0d521365e0ee3fdf7245eee11f","observation_id":"6fcfa0c8-4887-4ae8-ba1f-9d6c719b411d","resolution":{"observed_at":"2026-08-03T03:20:37.480115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.482456Z","title":"WL meet VC.International Conference on Machine Learning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.482456Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:dafffe1b0841bce6946230ce29c2b50984decafe6d68627fa3bab4cc9e9e3b94","observation_id":"58136ef5-b7c3-44e6-9362-b744400986b6","resolution":{"observed_at":"2026-08-03T03:20:37.482456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.484581Z","title":"Weisfeiler and leman go neural: Higher-order graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.484581Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:1af0066af553accc610eeed84796292268bfdbd005dad1718d4600cc47a12e0e","observation_id":"caf7d40b-ebe6-4fdd-8ab3-cd94a26b0aa9","resolution":{"observed_at":"2026-08-03T03:20:37.484581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.486976Z","title":"Generalization, ex- pressivity, and universality of graph neural networks on attributed graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.486976Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:1572a42ff410c4ba4766f2405bb7e793c022c5a06f3ead58a8dfb17eb69f7bed","observation_id":"22fca7d2-ab3d-4ea3-b367-af36e956be30","resolution":{"observed_at":"2026-08-03T03:20:37.486976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.489319Z","title":"A note on graphon-signal analysis of graph neural networks, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.489319Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:828ea8c0576d306cae4bc51bf001056608e91c68cdcbf44d9039b76b3f671979","observation_id":"c3da357e-83f9-49f8-a99f-ffa80f8d0927","resolution":{"observed_at":"2026-08-03T03:20:37.489319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.491886Z","title":"McGraw-Hill, 1976","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.491886Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:06481c46ab9c5b12e5b7bf0434921ed2314661b2099bf92a584192ca0a04af76","observation_id":"ef425aed-c89c-4674-8eb8-84154dc6509a","resolution":{"observed_at":"2026-08-03T03:20:37.491886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.494147Z","title":"Springer, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.494147Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4aef730ea8853977aeba6e09a2eb6b9c4e3a62fd4c0d54a8c7c6cfe7f3da82ed","observation_id":"6dfe81db-bcb6-4363-99c9-39ef65ffa83d","resolution":{"observed_at":"2026-08-03T03:20:37.494147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.496706Z","title":"The vapnik– chervonenkis dimension of graph and recursive neural networks.Neural Networks, 108:248–259, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.496706Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:949dd592cd9e405ef6f3118e0a350a5b29a8175cfe859519ee90dff7c071beac","observation_id":"7efef0ad-5c62-450f-954a-5fafe16b7fca","resolution":{"observed_at":"2026-08-03T03:20:37.496706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.499029Z","title":"Unbalanced optimal transport, from theory to numerics.Handbook of Numerical Analysis, 24:407–471, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.499029Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:7dbbc66ed15bad9896a143ede2f005866cb002091c4045cfe35d464c640a553f","observation_id":"4a264bbf-3812-4b77-804f-5fefaa36431e","resolution":{"observed_at":"2026-08-03T03:20:37.499029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.501580Z","title":"Cambridge university press, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.501580Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:544cad5e2779be6e638fdebcca6ba1e1fc7528be94fb41b736253ae0593ba730","observation_id":"60f6ab56-ff80-4446-8edd-f36d88cf5899","resolution":{"observed_at":"2026-08-03T03:20:37.501580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.504143Z","title":"American Mathematical Society, Providence, R.I, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.504143Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4c6d7bcd3e5c6411176b76baa9b615ca6fd4db48a1d697a4ba4c1dbb3e1bafce","observation_id":"bcce3d3a-3e9d-4a04-ad73-1bb68376a2e9","resolution":{"observed_at":"2026-08-03T03:20:37.504143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.506769Z","title":"Covered forest: Fine-grained generalization analysis of graph neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.506769Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:0846b835085c023b46e21953bcb613a94fd051b910e176a874579d38e01154d7","observation_id":"73108970-7c0f-4958-997a-d31df2510733","resolution":{"observed_at":"2026-08-03T03:20:37.506769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15650","last_updated":"2025-03-19T19:04:24Z","snapshot_observed_at":"2026-08-07T16:50:48.096411Z","submitted_at":"2025-03-19T19:04:24Z","title":"Survey on Generalization Theory for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15650","snapshot_observed_at":"2026-08-03T03:20:37.509061Z","title":"Survey on generalization theory for graph neural networks.arXiv preprint arXiv:2503.15650, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.509061Z"},"links":{"cited_paper":"/paper/2503.15650","citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:8c8413a377204487926ff17b89682b3ae3f6d1e10b16f35935a57c8e145fe80b","observation_id":"4e04b62e-8771-4145-a840-c5a224772be0","resolution":{"observed_at":"2026-08-03T03:20:37.509061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.511998Z","title":"Springer, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.511998Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:1c6e60bd47fdd83ecefac54c4a087c56461f517f59c1b3bdd7d9e867b3f283e6","observation_id":"42be840d-f5bf-4561-8f61-1a9cde56f31c","resolution":{"observed_at":"2026-08-03T03:20:37.511998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.514422Z","title":"Molecular contrastive learning of representations via graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.514422Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:db8336e49a72ba28fed4c02c6645e1a733da5f4613c3e31f37ac92a57f7cf7d1","observation_id":"b3fac593-f861-4dd6-ba3e-332d87ec48f7","resolution":{"observed_at":"2026-08-03T03:20:37.514422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.516683Z","title":"Robustness and generalization.Machine learning, 86:391–423, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.516683Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4ee7cac56b70cfe15a679f955ca367deb7dc44782202121c10922ff433b089e7","observation_id":"c6b977bf-083b-48e5-a61c-04b96c382784","resolution":{"observed_at":"2026-08-03T03:20:37.516683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.518896Z","title":"How pow- erful are graph neural networks?International Conference of Learning Representations, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.518896Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:fa8c6704ab0309b8d7c461d04c3b581bddaa7c63bf8508a2fa89d573b0314ec5","observation_id":"208e9917-931c-407a-9b36-353f1eac15ad","resolution":{"observed_at":"2026-08-03T03:20:37.518896Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.521655Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.521655Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:7a84f487c9af4d25617d138fea92a09ca868b38b7dd881f086b0a806f775b5d3","observation_id":"23f9ae19-ff76-4f2a-a319-0b3ab6ff9d1f","resolution":{"observed_at":"2026-08-03T03:20:37.521655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.524046Z","title":"A.2.4 Marginal Measures When a measure is defined on a product space, it often represents a joint distribution of a sequence of random variables","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.524046Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:284c90631a9d415aa3ae303c05f8c511b0231822b51f5140a6f5994de20e646e","observation_id":"e228cd98-115a-4a86-8259-b20c68b879ea","resolution":{"observed_at":"2026-08-03T03:20:37.524046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.526720Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.526720Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:163edebead979d55b46a0c25e927e459b632639cd28df1bede137f954da86dfd","observation_id":"aa858f41-95b6-44df-8d97-12fb0126689d","resolution":{"observed_at":"2026-08-03T03:20:37.526720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.529311Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.529311Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:3b800b40e0a6215f949396ce3a65e53594b6005accdb935b749608ed369b71fd","observation_id":"ac65d405-c78f-41ee-919a-fb010dbef9ac","resolution":{"observed_at":"2026-08-03T03:20:37.529311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.532164Z","title":"Intuitively (and informally), µx can be interpreted as a measure supported on the level set {w∈ Ω |f (w) = x}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.532164Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:00ce8292cfe32832edefb752c1757a46478b08501f61a8507a2e5ce03f36074e","observation_id":"22bde41d-e28f-4543-8d62-692fa6e5cb24","resolution":{"observed_at":"2026-08-03T03:20:37.532164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.534930Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.534930Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:32a997bdbefb75baa7a64cf0260cced4d00329fc921f7dd6ae5e1e041c43e241","observation_id":"9e0fb859-ef6c-489c-b425-dae5722e7a3b","resolution":{"observed_at":"2026-08-03T03:20:37.534930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.537531Z","title":"Monte Carlo approximation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.537531Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:463e4b4736830c6026d443a4096317f956be003c24a06eda46cd30a714815137","observation_id":"1d6e61c6-6bf7-422a-95b3-a834d9d23f24","resolution":{"observed_at":"2026-08-03T03:20:37.537531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.540027Z","title":"continuous node sets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.540027Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:d2236b43b3552dbff60ac6504be7eb693d216a46aa7b93fa323cf30ccf7ef604","observation_id":"3822b0fc-13b8-43c6-8667-1a6b0ca88749","resolution":{"observed_at":"2026-08-03T03:20:37.540027Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.543352Z","title":"Denote byB(Ω) the set of allP-operators on Ω","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.543352Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:2a32298c25d17e8ebbec42026dc6af2ec450e93b47cc5b0512bc1763dacab345","observation_id":"acba6d04-a8ad-4bd7-bcf0-0a8bf673ff9c","resolution":{"observed_at":"2026-08-03T03:20:37.543352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.545951Z","title":"Denote by Bp,q(Ω) the space of all P-operators with finite ( p, q) norm","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.545951Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:637951ec4a932b9a319bfeeebd0ada92b6d77d90f302d811429d338bcaa6a721","observation_id":"0f2dce2b-2032-4446-9d88-a0470d8dc3ca","resolution":{"observed_at":"2026-08-03T03:20:37.545951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.548560Z","title":"neighborhoods","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.548560Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:b7e19674916b0008fa0d2007061a3ff0a21b1756539a81ede173820c25226706","observation_id":"921a7585-46c3-451a-a0e5-bc1a291051b1","resolution":{"observed_at":"2026-08-03T03:20:37.548560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.551531Z","title":"Thediagonal marginalizationof ν, denoted by DMd(ν), is the Borel measure onR 2k obtained by marginalizing out the coordinatesy 2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.551531Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:f833a23bdc63cb2547a205d0954574836f8ba649a8f74a1ec346254eaefd7443","observation_id":"14274652-8056-435d-9157-3c68f4f18feb","resolution":{"observed_at":"2026-08-03T03:20:37.551531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.554085Z","title":"Explicitly, DMd(Sk,d) := n DMd(ν) ν∈S Td k,d o","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.554085Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4f2db19dc9edf72021b385b4df32d0da4cb62efac4c1d6bfaca39e7738244520","observation_id":"255e56bd-c1eb-4678-b3b9-67020d0f43e4","resolution":{"observed_at":"2026-08-03T03:20:37.554085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:37.558016Z","title":"graphing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:37.558016Z"},"links":{"citing_paper":"/paper/2602.08785"},"observation_digest":"sha256:4421d6b8eedf0d00f8e17e15f434b3326e299f7d529c8d8c9bfc353cc7ffcacf","observation_id":"cd4dac45-6335-4cad-93b4-e57252ad63bd","resolution":{"observed_at":"2026-08-03T03:20:37.558016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.08785","last_updated":"2026-06-08T16:26:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T11:17:00.060196Z","submitted_at":"2026-02-09T15:25:36Z","title":"A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":75,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":77},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2602.08785."}