{"as_of":"2026-08-10T15:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e045be6fdce6439737ecfade8571f276eb6ff048089af1ab2149ad5ce2121862","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:06:43.897055Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T22:16:42.731533Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.19173","last_updated":"2025-03-31T00:46:30Z","snapshot_observed_at":"2026-08-07T16:39:53.173701Z","submitted_at":"2025-03-24T21:52:05Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19173","snapshot_observed_at":"2026-08-05T16:06:43.897055Z","title":"Nerem, Samantha Chen, Sanjoy Dasgupta, and Yusu Wang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19052","last_updated":"2025-08-26T14:08:46Z","snapshot_observed_at":"2026-08-07T14:28:06.327663Z","submitted_at":"2025-08-26T14:08:46Z","title":"Automated discovery of finite volume schemes using Graph Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T16:06:43.897055Z"},"links":{"cited_paper":"/paper/2503.19173","citing_paper":"/paper/2508.19052"},"observation_digest":"sha256:dce3b407eb944a6ec467b0009f95a9d18196ac0b77616f3d9dc92eb2cc836c8a","observation_id":"76c7804b-ca17-4165-8c37-31ff0e85277c","resolution":{"observed_at":"2026-08-05T16:06:43.897055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19173","last_updated":"2025-03-31T00:46:30Z","snapshot_observed_at":"2026-08-07T16:39:53.173701Z","submitted_at":"2025-03-24T21:52:05Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19173","snapshot_observed_at":"2026-08-03T14:56:51.415954Z","title":"Nerem, Samantha Chen, Sanjoy Dasgupta, and Yusu Wang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.19332","last_updated":"2026-05-26T10:39:23Z","snapshot_observed_at":"2026-08-06T06:48:07.477107Z","submitted_at":"2025-12-22T12:27:36Z","title":"A Logical View of GNN-Style Computation and the Role of Activation Functions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T14:56:51.415954Z"},"links":{"cited_paper":"/paper/2503.19173","citing_paper":"/paper/2512.19332"},"observation_digest":"sha256:e7b05b1d07ba6ab88ae521359fe7b6decc284f7e07a7768a60cdb91ebbcad933","observation_id":"31762b2e-888b-4041-a65a-71a94bc597ee","resolution":{"observed_at":"2026-08-03T14:56:51.415954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19173","last_updated":"2025-03-31T00:46:30Z","snapshot_observed_at":"2026-08-07T16:39:53.173701Z","submitted_at":"2025-03-24T21:52:05Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19173","snapshot_observed_at":"2026-08-03T06:26:57.270350Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.23207","last_updated":"2026-06-05T15:55:12Z","snapshot_observed_at":"2026-08-10T03:51:50.070586Z","submitted_at":"2026-01-30T17:31:26Z","title":"Learning to Execute Graph Algorithms Exactly with Graph Neural Networks","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-03T06:26:57.270350Z"},"links":{"cited_paper":"/paper/2503.19173","citing_paper":"/paper/2601.23207"},"observation_digest":"sha256:05e9565051c1032a2d691237e0519db57a47c5c2b0e1bfcd5289440fde903381","observation_id":"bc14d2d8-8a6a-4163-aef0-f694e8db19e6","resolution":{"observed_at":"2026-08-03T06:26:57.270350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19173","last_updated":"2025-03-31T00:46:30Z","snapshot_observed_at":"2026-08-07T16:39:53.173701Z","submitted_at":"2025-03-24T21:52:05Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","version":2},"cited_work":{"arxiv_id":"2503.19173","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19173","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e6fb6715-c3f6-4727-8c9b-61f8d7d2542a","year":2025},"citing_paper":{"arxiv_id":"2602.13155","last_updated":"2026-05-13T09:47:05Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-13T18:08:23Z","title":"Learning to Approximate Uniform Facility Location via Graph Neural Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T22:14:13.928500Z"},"links":{"cited_paper":"/paper/2503.19173","citing_paper":"/paper/2602.13155"},"observation_digest":"sha256:897dac41f6a868f1feb27df02caf91311121fe1e14e1170368d415dcf9804c3d","observation_id":"94ba259c-252c-4d11-bbbe-1cdb11d22e35","resolution":{"observed_at":"2026-05-15T22:16:42.734678Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.19173/citation-record","integrity":"/paper/2503.19173/integrity","json":"/paper/2503.19173/citation-record.json","paper":"/paper/2503.19173"},"outbound":[],"paper":{"arxiv_id":"2503.19173","last_updated":"2025-03-31T00:46:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:39:53.173701Z","submitted_at":"2025-03-24T21:52:05Z","title":"Graph neural networks extrapolate out-of-distribution for shortest paths"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.19173."}