{"as_of":"2026-08-15T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:994db9c0e46bb5a6d789672d09daa6d2dcb1a9a9b7a6379e79697e6e79735771","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:03:53.601608Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:47:38.908007Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.06894","snapshot_observed_at":"2026-08-04T16:47:38.908007Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds.arXiv preprint arXiv:2509.06894, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.12484","last_updated":"2026-07-21T16:28:04Z","snapshot_observed_at":"2026-08-11T02:27:35.407378Z","submitted_at":"2025-09-15T22:11:56Z","title":"Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T16:47:38.908007Z"},"links":{"cited_paper":"/paper/2509.06894","citing_paper":"/paper/2509.12484"},"observation_digest":"sha256:832067ed0b108397497f859e15f8af78b7e6000a903456778fb0943fe3e0c5cc","observation_id":"68c18e68-5446-44da-ad3b-aa185ac2bf39","resolution":{"observed_at":"2026-08-04T16:47:38.908007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.06894","snapshot_observed_at":"2026-08-03T05:00:58.184360Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds.arXiv preprint arXiv:2509.06894, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.03970","last_updated":"2026-05-31T09:26:13Z","snapshot_observed_at":"2026-08-14T14:03:14.169995Z","submitted_at":"2026-02-03T19:39:53Z","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:58.184360Z"},"links":{"cited_paper":"/paper/2509.06894","citing_paper":"/paper/2602.03970"},"observation_digest":"sha256:90e64ef65249c4199aa310972f073fff8f0265097ea8b0ceefed201624ef1c7a","observation_id":"b955126c-5e27-48ca-8741-b846807567f3","resolution":{"observed_at":"2026-08-03T05:00:58.184360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.06894/citation-record","integrity":"/paper/2509.06894/integrity","json":"/paper/2509.06894/citation-record.json","paper":"/paper/2509.06894"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.348901Z","title":"Zero-one laws of graph neural networks.Advances in Neural Information Processing Systems, 36:70733–70756, 2023","venue":null,"work_id":"43bd719f-02d0-4925-9cf5-563d027712c6","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:47.840994Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:feb2a032dc72ddefdd8bedc84228e1400cd8a4cb28ebe8cad48258cf97104734","observation_id":"9ce0efa7-76e5-4304-b26c-eb9fae4f3fff","resolution":{"observed_at":"2026-08-04T23:03:56.353708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:47.905379Z","title":"Stronger generalization bounds for deep nets via a compression approach","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:47.905379Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:15c330e8eb4b95ac1baf3c99b2b09d604a68515a5d292db431a5d41a3002fc88","observation_id":"4d7f1e04-3e09-45fc-85b2-49c788571b80","resolution":{"observed_at":"2026-08-04T23:03:47.905379Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.324113Z","title":"Plongements Lipschitziens dansRn.Bulletin de la Société Mathématique de France, 111:429–448, 1983","venue":null,"work_id":"6e1d1987-9127-4d80-8881-a748a7d91da9","year":1983},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:47.974965Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:882de1f9171fc4a1f00cef3281e64f1d336a27e162120cab886c7a645e48f83f","observation_id":"e2431f5f-7a4b-447c-b038-45146afc3533","resolution":{"observed_at":"2026-08-04T23:03:56.328682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.309280Z","title":"High-dimensional analysis of double descent for linear regression with random projections","venue":null,"work_id":"664497f7-96d8-4b40-bcf1-a5158daa05da","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.037449Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:faf7e7a119172ee45c2ad2c54084c46c9c3c6eec63f253c16d20b7213ae29001","observation_id":"d75e1e7c-c488-48a1-9d91-710483e569b2","resolution":{"observed_at":"2026-08-04T23:03:56.313865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.293828Z","title":"Failures of model-dependent generalization bounds for least-norm interpolation.Journal of Machine Learning Research, 22(204):1–15, 2021","venue":null,"work_id":"92714259-21fd-42ec-b6c8-e1f9b3975d38","year":2021},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.119326Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:d73572e6c5290e50548f1c34de4021423477ffcdaabfe2fd2a062cf46afd08c6","observation_id":"d8595e82-831e-4863-81f3-56ffd03969d7","resolution":{"observed_at":"2026-08-04T23:03:56.298982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:48.150593Z","title":"Two models of double descent for weak features.SIAM Journal on Mathematics of Data Science, 2(4):1167–1180, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.150593Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:4c0595e8069a88354a334501debdc6404b68dec7a6e05545a23b69c6e2cf0607","observation_id":"de3f21d7-a29c-41a9-a150-93192864e43a","resolution":{"observed_at":"2026-08-04T23:03:48.150593Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.266464Z","title":"Cambridge University Press, Cambridge, second edition, 2001","venue":null,"work_id":"69c4f000-33bb-4bcd-8ae5-6c7a0aa9865f","year":2001},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.227614Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:64b5fcb7f4b9ab4ff83fbb37b714bd6aca60836f879a82c3bb22bd88813d3251","observation_id":"b1dc0968-662c-425f-9b2e-0855dbe7a55d","resolution":{"observed_at":"2026-08-04T23:03:56.271627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.251226Z","title":"Compositional PAC-bayes: Generalization of GNNs with persistence and beyond","venue":null,"work_id":"a1ff54d9-b07d-4e04-917d-a52f80f30982","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.301086Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:839cb0131e098b8019b9f980610b5a1baa2f78ce6518fdd3ad39a14701e88db7","observation_id":"4a54e51f-37bb-4cce-9176-c8954737292e","resolution":{"observed_at":"2026-08-04T23:03:56.256052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-08-12T23:06:05.148534Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-04T23:03:48.359358Z","title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges.arXiv preprint arXiv:2104.13478, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.359358Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:e352ade2e3ec0a12b5f02af66d0ac42af5027a66dbd3510d830df904f338234e","observation_id":"62489fa9-e7da-4349-a648-0dd7b73f442e","resolution":{"observed_at":"2026-08-04T23:03:48.359358Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.236270Z","title":"Tony Cai and Mark G","venue":null,"work_id":"8692a2ad-3db3-4d41-9073-e5916553a235","year":2011},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.445638Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:6fed99de317767436dfef4e3ed39ec11f26a2a5e1945e8c1bd890ff738e261ad","observation_id":"48c00646-fce1-46ba-bccf-0c25eef81c52","resolution":{"observed_at":"2026-08-04T23:03:56.240664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.221497Z","title":"Mean field games with common noise.The Annals of Probability, 44(6):3740–3803, 2016","venue":null,"work_id":"8872e16b-8f9d-4b2f-bc12-98bd8180b203","year":2016},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.519872Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:38e2754c1f5e5ddcad5d50546c11832969231e6eeaf41a53354508a07112c43e","observation_id":"516ecccd-5418-4336-ae0e-5f3a4cf85f26","resolution":{"observed_at":"2026-08-04T23:03:56.226106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.206355Z","title":"Connected components in random graphs with given expected degree sequences.Annals of Combinatorics, 6(2):125–145, 2002","venue":null,"work_id":"f6243a07-34c4-4c2b-ad82-64f760cf57f0","year":2002},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.640359Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:b168be9fc298dd779701454d5132709ac8d6ff2bc3131508b145b79419045b97","observation_id":"346aa5b1-fdda-48e5-a9bc-071b9233364e","resolution":{"observed_at":"2026-08-04T23:03:56.211373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.189514Z","title":"Das and Pawan Kumar","venue":null,"work_id":"473ee598-ab7f-4464-af0f-f0689619c882","year":2004},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.726167Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:2afdd3255c56ef410bf23576c0545e52a50e3b06a3a9c519a0fc1363f82e4e33","observation_id":"026d37ef-b3a5-4a63-b049-3a3f8666b270","resolution":{"observed_at":"2026-08-04T23:03:56.194527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.171962Z","title":"A non-probabilistic proof of the Assouad embedding theorem with bounds on the dimension.Analysis and Geometry in Metric Spaces, 1(2013):36–41, 2013","venue":null,"work_id":"a60105c0-9c10-475b-aa9a-a3b49283f0e3","year":2013},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.773680Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:2b9d3776ff84c637914771d1cd6288975a1c6b1e48eec1f278d89717e9854940","observation_id":"0d7672fa-38d0-41fd-b8fb-f947f688a937","resolution":{"observed_at":"2026-08-04T23:03:56.176904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.156441Z","title":"McKean-Vlasov optimal control: the dynamic programming principle.The Annals of Probability, 50(2):791–833, 2022","venue":null,"work_id":"db48d27e-a652-4b54-ade6-9837173472c6","year":2022},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.853190Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:6aea6d1107f81d16313f3f1b14b0cf40c9eb9900d849f199bcd2408697c8a085","observation_id":"289969b8-1483-4617-b4e1-d69eaa546865","resolution":{"observed_at":"2026-08-04T23:03:56.161412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.139391Z","title":"Doublingconstantsandspectraltheory on graphs.Discrete Mathematics, 346(6):Paper No","venue":null,"work_id":"a9c46fdd-8b2e-4abd-84d4-f1904a2d958c","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.911938Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:41f0409eace82059731f0d55471742fed98351a4bc5dae5d8df589efe2e723f3","observation_id":"80c46952-2392-47e5-b760-7a3663fb46f1","resolution":{"observed_at":"2026-08-04T23:03:56.144204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.11008","last_updated":"2017-10-19T03:39:56Z","snapshot_observed_at":"2026-08-14T21:08:53.042410Z","submitted_at":"2017-03-31T17:56:41Z","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.11008","snapshot_observed_at":"2026-08-04T23:03:48.999114Z","title":"Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data.arXiv preprint arXiv:1703.11008, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:48.999114Z"},"links":{"cited_paper":"/paper/1703.11008","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:0edf89334ba7d8373abd87f9f658ced313c3b16916c4adc2c5fd2e629d31fbcf","observation_id":"b3c30f81-df46-46e7-a35e-4c704829b11d","resolution":{"observed_at":"2026-08-04T23:03:48.999114Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.124579Z","title":"On the approximation capability of gnns in node classification/regression tasks.Soft Computing, 28(13):8527– 8547, 2024","venue":null,"work_id":"4d3f1fda-c0ed-4b17-a75c-edc464fdf9d3","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.083701Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:30231ebf7599cc43c035052030cbca80f8bf2b9e6c6a7015f2c25fbc711a81f5","observation_id":"04633fb7-6b94-42d2-becf-0763fdb4ba7a","resolution":{"observed_at":"2026-08-04T23:03:56.129365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.108986Z","title":"Transductive Rademacher complexity and its applications.Journal of Artificial Intelligence Research, 35:193–234, 2009","venue":null,"work_id":"9d8d5b17-967a-4960-a775-9ebf390f4f4a","year":2009},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.189402Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:8599525b61209682a9491b7be48045aa27289be7206d9680a961af2bdfc11279","observation_id":"68d0a97e-41e4-4c9c-916c-a46bda11ea6f","resolution":{"observed_at":"2026-08-04T23:03:56.114050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:49.262331Z","title":"On the rate of convergence in Wasserstein distance of the empirical measure.Probability Theory and Related Fields, 162(3):707–738, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.262331Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:f35e7e555098618d4df3810633dccfbb02df23af598422ff3d1c68808d56a579","observation_id":"72cdd9cb-c090-4109-8f29-8138756dc2ee","resolution":{"observed_at":"2026-08-04T23:03:49.262331Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.082584Z","title":"Generalization and representational limits of graph neural networks","venue":null,"work_id":"eaee045f-2998-4f6f-b7f9-0743626ad4ce","year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.324366Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:a29aa42c93f3209a6459a19f146bad325c83da055c701a1c84e8f1ad8f9cb384","observation_id":"d1422f8e-2256-4435-ae89-937da80d2bf9","resolution":{"observed_at":"2026-08-04T23:03:56.087204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.067364Z","title":"Fast construction of nets in low-dimensional metrics and their applications.SIAM Journal on Computing, 35(5):1148–1184, 2006","venue":null,"work_id":"b2e41a25-fecd-4981-b0e9-72a0b95d57ad","year":2006},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.430884Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:c9e9a96d5bb49ad36f08ec459ae0b057c8a055ce2abb688c05c765adff7882aa","observation_id":"4f50d748-aac2-44a4-a019-f6885d52b39a","resolution":{"observed_at":"2026-08-04T23:03:56.072223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.051781Z","title":"Universitext","venue":null,"work_id":"8dbdbcb0-1a23-434e-ab61-1d5cd267e089","year":2001},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.501057Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:b31842653c1f1d34ca3fe6ca525b45c7e496a59df3d13001b1ef4d3a5fb0b241","observation_id":"97b9456f-a8ef-4c35-abea-ebe4884f1041","resolution":{"observed_at":"2026-08-04T23:03:56.056335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:49.580710Z","title":"Cambridge university press, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.580710Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:f026482bd99588d81ac657b7390848bd42f85f9c7f4009f97b634742b73a5b5b","observation_id":"3aef1010-56ec-4d04-9a4f-2ff7ae1fcbf8","resolution":{"observed_at":"2026-08-04T23:03:49.580710Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.025744Z","title":"Instance- dependent generalization bounds via optimal transport.Journal of Machine Learning Research, 24(349):1–51, 2023","venue":null,"work_id":"b806be7d-6ca1-413d-91ce-397c869c9552","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.638335Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:b563f8d804f8d180fdd6c6cfe8718d15689a46f53f9854fbf5bc9e9e5fd67fe0","observation_id":"05420ebe-4b46-475a-9c89-26d32543fc59","resolution":{"observed_at":"2026-08-04T23:03:56.030798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:56.011309Z","title":"Big Data + Big Cities: Graph Signals of Urban Air Pollution [Exploratory Sp].IEEE Signal Processing Magazine, 31(5):130–136, 2014","venue":null,"work_id":"ed49275b-d150-4563-ba0d-95f691f26c54","year":2014},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.716475Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:02df8ed12dbfab6bb6e305e057708dfeffcfe16c88ccb08d9fffbc9a3891fd82","observation_id":"5e3ffd45-ec2b-4c3a-8a2f-a8723e9ed07f","resolution":{"observed_at":"2026-08-04T23:03:56.016139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.996581Z","title":"Practical graph signal sampling with log-linear size scaling","venue":null,"work_id":"41eb82f1-3c5d-4980-92ed-78cc1b52e054","year":2022},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.787477Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:774254943988ae0b5f4cb2f1604376e9f6d6de2620e4103472cb71173ebcdd52","observation_id":"2b35e836-e5f2-4f60-b75c-c369cf250655","resolution":{"observed_at":"2026-08-04T23:03:56.001156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.980393Z","title":"Prediction of protein–protein interaction using graph neural networks.Scientific Reports, 12(1):8360, 2022","venue":null,"work_id":"aafde8e3-b418-4993-a649-67a2e5091a3d","year":2022},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:49.925466Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:1a027ee9f8cfba4610b91b66538bb9a59c3d7475a73518bc135932c20d1cae3b","observation_id":"1799fa2d-22de-4956-81ff-eef9d69eccc2","resolution":{"observed_at":"2026-08-04T23:03:55.985839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.963827Z","title":"Minimax estimation of functionals of discrete distributions.IEEE Transactions on Information Theory, 61(5):2835–2885, 2015","venue":null,"work_id":"8620fe69-c572-47dd-b920-5ab16ec7e9c0","year":2015},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.007376Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:53e77a0f744541a33ed8ec3bd212714a91caabeb301a202c641feb56d171f01d","observation_id":"0af47754-ad6a-4fa2-9b67-30b8a9623b52","resolution":{"observed_at":"2026-08-04T23:03:55.968971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.948601Z","title":"Personalized Explanations for Early Diagnosis of Alzheimer’s Disease Using Explainable Graph Neural Networks with Population Graphs.Bioengineering, 10(6):701, 2023","venue":null,"work_id":"d872b5a2-b423-4544-ae63-ab7b495e21f6","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.139579Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:dc3d50ebcf1bc42b32bb09700f39c7a07a49b29d9966695db20c7a570c2924a8","observation_id":"4bd964c5-b2cb-4dd5-9f84-6e2adbecf2fd","resolution":{"observed_at":"2026-08-04T23:03:55.953680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.934183Z","title":"Kipf and Max Welling","venue":null,"work_id":"0d0731a8-9893-4ee9-b5ea-6df37fe2b5e5","year":2017},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.326721Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:3eef25e17ef308b488b717ce7365b458c703a10670de137702c8229e957738c9","observation_id":"ac95b368-707a-47e2-9ed5-be5c225b5242","resolution":{"observed_at":"2026-08-04T23:03:55.938499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.919098Z","title":"Kloeckner","venue":null,"work_id":"eff43424-d317-4a2d-8b94-d594a61f7f08","year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.348783Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:8c32998d9f7ce6efd408f11a3dcac84897db47a945cd6900f10be28f2ee0d1c6","observation_id":"52d7c269-a61e-481e-9cad-9e5f09a3694d","resolution":{"observed_at":"2026-08-04T23:03:55.923754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.902360Z","title":"Exactlowerboundsfortheagnosticprobably-approximately-correct (PAC) machine learning model.The Annals of Statistics, 47(5):2822–2854, 2019","venue":null,"work_id":"d6828e96-00af-436e-8cc4-4555a259dda4","year":2019},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.422703Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:20b7026e8619f7aa4cb810bde952498e37d53f00f65e7148276efb50b335025c","observation_id":"c4f5a8c2-58b3-4038-ad4d-9ebddc4094db","resolution":{"observed_at":"2026-08-04T23:03:55.907582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05576","last_updated":"2026-05-13T08:37:33Z","snapshot_observed_at":"2026-08-13T02:35:06.704229Z","submitted_at":"2024-02-08T11:23:11Z","title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","version":4},"cited_work":{"arxiv_id":"2402.05576","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.05576","snapshot_observed_at":"2026-08-04T23:03:54.485551Z","title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","venue":"cs.LG","work_id":"5f7da830-632e-418c-b009-31f305abecdb","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.483147Z"},"links":{"cited_paper":"/paper/2402.05576","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:2d303ba21965c8ac4d3afd85e20155894aefd4c243c376268f883192f7738ae8","observation_id":"d6729c64-240b-4f4b-8f22-215d31a2a614","resolution":{"observed_at":"2026-08-04T23:03:54.556002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:50.544321Z","title":"Learning skillful medium-range global weather forecasting.Science, 382(6677):1416–1421, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.544321Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:75251074f7ba653729ef19eeb36695db9554b54c3889910ab2bab8f584bdc995","observation_id":"49334daf-2beb-407b-aa0f-a43d3c1115a2","resolution":{"observed_at":"2026-08-04T23:03:50.544321Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.877157Z","title":"Lepski, A","venue":null,"work_id":"067e8541-eeab-4554-9b98-afa387b39abc","year":1999},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.698577Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:840a16be693a5a4e37ffbdde51f9feb82f28bce50d75ac837a2837596ab4a750","observation_id":"333e1b52-7519-4b2f-8797-aaff6c087901","resolution":{"observed_at":"2026-08-04T23:03:55.883179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.858608Z","title":"A graphon-signal analysis of graph neural networks.Advances in Neural Information Pro- cessing Systems, 36:64482–64525, 2023","venue":null,"work_id":"6123272c-924b-4e30-a0c2-9cc8ba600c97","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.847420Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:681ecb723eb93c0b9042574c6d8249ba1fea8d9bc6840103f408ae336cb444be","observation_id":"bc77ca5e-f16c-4a44-883f-981c54dfe10e","resolution":{"observed_at":"2026-08-04T23:03:55.863602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.07690","last_updated":"2020-12-14T16:41:23Z","snapshot_observed_at":"2026-08-14T18:28:23.644831Z","submitted_at":"2020-12-14T16:41:23Z","title":"A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2012.07690","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.07690","snapshot_observed_at":"2026-08-04T23:03:54.270609Z","title":"A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks","venue":"cs.LG","work_id":"abed6f4b-730c-4d60-a136-c09ec694e7f0","year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:50.994015Z"},"links":{"cited_paper":"/paper/2012.07690","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:ca624bbf54bd515023d68167d15f4f0020fe27d68fb51dbb14ed28523a368db6","observation_id":"420e43b3-472b-47af-b2bf-b241dd31891a","resolution":{"observed_at":"2026-08-04T23:03:54.363940Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.840487Z","title":"Lorentz, Manfred v","venue":null,"work_id":"630d05fb-077d-448e-a15b-d4f6cc98abdc","year":1996},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.132892Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:3237d432bf4cd40e78b06dbb645f7b4d8aed85dd596ba2fbbcae49e20dd6e697","observation_id":"8493292e-4d3d-41e2-9f05-624611d2602e","resolution":{"observed_at":"2026-08-04T23:03:55.847138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.821652Z","title":"Cambridge University Press, 2021","venue":null,"work_id":"7d52e521-f09d-4e24-9d78-91113061016d","year":2021},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.227105Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:3717c8c32f9107a0ff0441a7c45b28762948ce32769870b20eb873e2bb125712","observation_id":"a7101320-1401-4fab-ada7-45bb9a62cc59","resolution":{"observed_at":"2026-08-04T23:03:55.826332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.804240Z","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":"e4333866-788a-46f6-853b-39f95424ae2c","year":2025},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.318169Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:ea5fcca627a253b01f163def959e0f6006486f997e13bd40709ccef239787139","observation_id":"f769c981-9ab7-49ea-9beb-edab26c62736","resolution":{"observed_at":"2026-08-04T23:03:55.809223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.786743Z","title":"Bi-lipschitz embeddings into low-dimensional euclidean spaces.Commentationes Math- ematicae Universitatis Carolinae, 031(3):589–600, 1990","venue":null,"work_id":"272f9910-2d1a-4296-b63f-1d6fffc475e3","year":1990},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.366927Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:4661514120b8d5156905a324386498f159bef89e76cb09d24adbda429d120cc8","observation_id":"429e2bcc-3a61-4869-9d83-4fd1e1eb9aeb","resolution":{"observed_at":"2026-08-04T23:03:55.792303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.769480Z","title":"Springer- Verlag, New York, 2002","venue":null,"work_id":"bc8831c3-b932-4c64-aa82-c5082912d54a","year":2002},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.471839Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:a842c4eae3e84cf8daaf97b44918c3fad7ebfc7c19d49f1124d0c8a2dfe3d094","observation_id":"e5ca0dc1-3e93-4de5-9e3f-566e8f99d67b","resolution":{"observed_at":"2026-08-04T23:03:55.775291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.752520Z","title":"When and why are deep networks better than shallow ones? InProceedings of the AAAI conference on artificial intelligence, volume 31, 2017","venue":null,"work_id":"32c640bf-6768-4dd9-b8c8-4030681625dc","year":2017},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.549753Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:d14d7948170f168910781586c419fcfbe6483f54e240fcc837fdff30eac16354","observation_id":"be4f7880-b889-49bd-a5da-5fff78617aa9","resolution":{"observed_at":"2026-08-04T23:03:55.757946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.734847Z","title":"Assouad’s theorem with dimension independent of the snowflaking.Revista Matematica Iberoamericana, 28(4):1123–1142, 2012","venue":null,"work_id":"e4a27c01-cb30-431d-9a9b-37727fc5587c","year":2012},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.639336Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:3b0b9f766f9717005eb3885ac239a5ac127611aaebac5ff1e5dca2b9991f1e4b","observation_id":"261c5455-73a9-40a1-97fb-9d734f9a571e","resolution":{"observed_at":"2026-08-04T23:03:55.740288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.715413Z","title":"Low dimensional embeddings of doubling metrics.Theory Comput","venue":null,"work_id":"86304fb2-fa7c-449c-93bf-96b3bda11db7","year":2016},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.734852Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:4da7e5881403106c78c337969a3abf21218ea554bca273a5cad1a85dc72a12aa","observation_id":"ab723e28-dbeb-42a1-b8ce-31cab430387a","resolution":{"observed_at":"2026-08-04T23:03:55.721201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.696916Z","title":null,"venue":null,"work_id":"7736f0da-f946-4113-96c8-886c0898bfd1","year":2025},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.763424Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:bc3c611e5eca22fc5532654032aed6ae0e24e66f30ca1ccc7c817c87080b5e9e","observation_id":"41feeed3-2d92-46a4-a807-dee08500ee1c","resolution":{"observed_at":"2026-08-04T23:03:55.703045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.678104Z","title":null,"venue":null,"work_id":"61382679-f39f-4cb0-8b6f-e35ef29fd334","year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:51.902312Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:e5036faf91f1e48a46f64f00806e494eb1812caad967da51b4afea017fafcc22","observation_id":"baec5450-74fa-49c3-85ad-ecb7f4820b39","resolution":{"observed_at":"2026-08-04T23:03:55.683826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.659556Z","title":"Fake news detection: A survey of graph neural network methods.Applied Soft Computing, 139:110235, 2023","venue":null,"work_id":"d1609c73-979c-4809-9747-3bca8eb1370e","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.003644Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:7e67652290918902b7491d2e350d19b7293680bb81d19b09468aa4b7c65ce47b","observation_id":"f466ec3b-a711-46d8-9523-7b919b6c1486","resolution":{"observed_at":"2026-08-04T23:03:55.664947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.632065Z","title":"Real analysis, 4th edition.Printice-Hall Inc, Boston, 2010","venue":null,"work_id":"3d11f7cc-700c-4a16-9841-c7f254f372b0","year":2010},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.091612Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:c5598eb1858a1c5168ea8dcc22c998d6dbe91ffdad15276d44230219beed66b1","observation_id":"8d63dbf1-528c-4bce-ba43-fa19f69c88aa","resolution":{"observed_at":"2026-08-04T23:03:55.637580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.616384Z","title":"The Vapnik-Chervonenkis dimension of graph and recursive neural networks.Neural Networks, 108:248–259, 2018","venue":null,"work_id":"5b741d65-fc9e-4369-87a7-10ac7e8c890f","year":2018},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.145641Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:55bc9d809962aef1a43d79d674181505dc42476ee3279086b5cf20c7ec72ba70","observation_id":"372ae754-db67-41a7-ade0-46cdaf26ae34","resolution":{"observed_at":"2026-08-04T23:03:55.621951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.600880Z","title":"Metric spaces and completely monotone functions.Annals of Mathematics, 39(4):811–841, 1938","venue":null,"work_id":"92594f75-f65e-46da-9690-cac0fb9d9421","year":1938},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.249601Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:0b00c7536afac25b4425b487e93724889bbdbe534b59608e3543507bf13ad0e8","observation_id":"7f272c5b-180f-49aa-b59b-97dd935995d2","resolution":{"observed_at":"2026-08-04T23:03:55.605775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:52.320206Z","title":"Cambridge university press, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.320206Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:6a075c9e66e01dcaf5450dcf6068bb6b5ca8e2156132b9c7bf57aee3487fea6b","observation_id":"8b2da571-279a-46d5-a112-258f37ff7649","resolution":{"observed_at":"2026-08-04T23:03:52.320206Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.573732Z","title":"Homophily modulates double descent generalization in graph convolution networks.Proceedings of the National Academy of Sciences, 121(8):e2309504121, 2024","venue":null,"work_id":"ed17eec0-a2ba-4e6a-8179-baeb5a832b96","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.392009Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:44777ce0d5c491e9e53711cbd5e22f89f1088ff0dd2c9d998a235a4108a653e9","observation_id":"19fcc69c-aa2f-4e5a-9aa9-90e0037251fc","resolution":{"observed_at":"2026-08-04T23:03:55.578734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.556501Z","title":"The least doubling constant of a metric measure space.Annales Fennici Mathematici, 44(2):1015–1030, 2019","venue":null,"work_id":"755546f9-7d5a-4756-8532-edf4264cac59","year":2019},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.496061Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:e39de8aca4ff0516b42602af1ec57af98c6605696abd460b42b97651ab76048d","observation_id":"431f9173-0c98-47ea-9b60-0d5e607ae817","resolution":{"observed_at":"2026-08-04T23:03:55.562313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.538693Z","title":"Bronstein","venue":null,"work_id":"31abbdd0-6416-4378-9ed4-6de82e71ea34","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.604265Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:0af7abb6ec013d1ffde194231ccd70da818c54f49504cbaf3364e727009a491f","observation_id":"00f722a1-8d19-45db-8ca7-a0dcc1a014c1","resolution":{"observed_at":"2026-08-04T23:03:55.545372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04561","last_updated":"2025-01-21T02:18:46Z","snapshot_observed_at":"2026-08-14T18:28:25.140428Z","submitted_at":"2023-11-08T09:48:42Z","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","version":3},"cited_work":{"arxiv_id":"2311.04561","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.04561","snapshot_observed_at":"2026-08-04T23:03:54.092108Z","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","venue":"cs.LG","work_id":"9c7bb130-687c-4c9f-ad09-a6e709741b61","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.686021Z"},"links":{"cited_paper":"/paper/2311.04561","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:f65b92c3124a515599aa520530d7764195c841e3d3ebbe2b03306bc8c889431f","observation_id":"24e2cd5b-9915-48b9-ab26-e626798f3b18","resolution":{"observed_at":"2026-08-04T23:03:54.173785Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.522150Z","title":"Weak convergence","venue":null,"work_id":"41142668-9f88-407b-a13b-2cba59530ca7","year":1996},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.789320Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:3f58efe496773937aafe0788c81da63f21d3288ef1b16d973f4ea83f31d15634","observation_id":"e61994d6-7960-4290-8c29-cd0ebdf336d4","resolution":{"observed_at":"2026-08-04T23:03:55.526927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.502209Z","title":"Estimation of dependences based on empirical data: Springer series in statistics (springer series in statistics), 1982","venue":null,"work_id":"df74c36a-2932-4406-b80b-4ea8468eceff","year":1982},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.862310Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:5c6ca32fc993c6b18aa1ae452054aeea5bae4ba42a03b503ca09d56d9b2bb5e1","observation_id":"cf7fa15a-2f77-490c-8cd0-71b1d10acba9","resolution":{"observed_at":"2026-08-04T23:03:55.507251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:52.919362Z","title":"Springer, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:52.919362Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:926908d4957ee8800fde2d5d0e31451bfa8864f51a0037d6e7eae583b47ec462","observation_id":"100543af-2ee3-43b3-81a7-f11105ccff8a","resolution":{"observed_at":"2026-08-04T23:03:52.919362Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.475078Z","title":"Recommending related products using graph neural networks in directed graphs","venue":null,"work_id":"04f6787a-825a-4ef9-b55e-555242f45847","year":2022},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.009511Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:361180b0682cb2d0096f3c5fc8483a5089abaf594920fe13006c3f15fd4992ee","observation_id":"e76f1533-f564-43fe-a3b1-46eb3029ad79","resolution":{"observed_at":"2026-08-04T23:03:55.480268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.389706Z","title":"Machining feature process route planning based on a graph convolutional neural network.Advanced Engineering Informatics, 59:102249, 2024","venue":null,"work_id":"49ad3462-ef2f-4209-a69d-e205acd2b29a","year":2024},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.117979Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:709e74b92843ea04404315c39382bfaca55c24aeaf20c2bf696afc101e14472d","observation_id":"3a947827-f1c2-41cf-a024-a1b223dc7dcf","resolution":{"observed_at":"2026-08-04T23:03:55.463473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2309.16858","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:53.906502Z","title":"Sharp generalization of transductive learning: A transductive local Rademacher com- plexity approach.arXiv preprint arXiv:2309.16858, 2023","venue":null,"work_id":"cf260e80-89d6-4bab-addc-39aa20a7b6d5","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.180801Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:d10940581f7bfccb764b74f3fc50738c013594151869e301aa2468fe8c4076fa","observation_id":"6909124d-0718-4d87-b4bb-ea1db4ee478a","resolution":{"observed_at":"2026-08-04T23:03:53.973745Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12519","last_updated":"2025-04-16T22:39:41Z","snapshot_observed_at":"2026-08-11T00:38:59.947693Z","submitted_at":"2025-04-16T22:39:41Z","title":"Corner Gradient Descent","version":1},"cited_work":{"arxiv_id":"2504.12519","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.12519","snapshot_observed_at":"2026-08-04T23:03:53.722408Z","title":"Corner Gradient Descent","venue":"math.OC","work_id":"b74d2c73-b677-4d84-a5e7-70c987d73a27","year":2025},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.251619Z"},"links":{"cited_paper":"/paper/2504.12519","citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:7c43c586cfab91736066f5f32aa5d323a310f63937cdce12a481f61b20567301","observation_id":"beb6652a-3fc2-4445-bd65-99edc33bc50f","resolution":{"observed_at":"2026-08-04T23:03:53.796280Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.269735Z","title":"The phase diagram of approximation rates for deep neural networks","venue":null,"work_id":"db2b8a40-0e59-44f2-9d96-108cf39d8383","year":2020},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.308085Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:a4e821dcdb500c921496a9680372184f5a32e683fd5bcb7f40035cdf86823140","observation_id":"58bdb7eb-47f8-43ae-9f5c-1395f98b7e1c","resolution":{"observed_at":"2026-08-04T23:03:55.329715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:55.057701Z","title":"Strong data processing inequalities for locally differentially private mechanisms","venue":null,"work_id":"f214f7df-6451-45f0-9272-645d7ded9479","year":2023},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.401154Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:53ded4cac28df61eff39a6a188cc7ceaa4a8bc8df28b16c509d0942c34da8f3f","observation_id":"9b2d6eae-9022-451a-aa86-e3bf16c18408","resolution":{"observed_at":"2026-08-04T23:03:55.164453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:54.883404Z","title":"Link prediction based on graph neural networks","venue":null,"work_id":"fcb56cb7-49d7-4ff3-b97e-6271086fc36a","year":2018},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.510056Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:622f84475fa13f2d2e49f412104168d0f956b2cfcb4e71fa23777ec5c0a39ab7","observation_id":"173f16a0-f079-4a15-af35-0c5b54fc556e","resolution":{"observed_at":"2026-08-04T23:03:54.951294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:03:54.697403Z","title":"Dgcn: Diversified recommendation with graph convolutional networks","venue":null,"work_id":"300740f5-21d9-4046-b669-2b852f23bb76","year":2021},"citing_paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T23:03:53.601608Z"},"links":{"citing_paper":"/paper/2509.06894"},"observation_digest":"sha256:1201fb869c77303d4089ce3289f6473ae938b8e035c6556c2c43060171b353d3","observation_id":"47a80999-4961-44ec-a418-d1e9e6aa8b69","resolution":{"observed_at":"2026-08-04T23:03:54.774529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.06894","last_updated":"2025-09-08T17:13:28Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T16:05:57.033316Z","submitted_at":"2025-09-08T17:13:28Z","title":"Learning from one graph: transductive learning guarantees via the geometry of small random worlds"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":5,"verified_fuzzy":52},"total_outbound_references":68},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 2 inbound Pith citation observations for arXiv:2509.06894."}