{"as_of":"2026-08-07T20:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:264d04c77e2ac0bc14666860291ddadad3ce88343a122ebf1900d64af565c937","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":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:45:04.612182Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":233,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-17T02:33:38.686468Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2105.14491"},"observation_digest":"sha256:87bc3c3d57485d296adfabc6c5f85afedef09ad7bc3b38cd6a1a84675c38b12a","observation_id":"b78e0c5e-d034-401b-8588-9d532333d95a","resolution":{"observed_at":"2026-05-17T02:33:38.769399Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2412.08835","last_updated":"2026-04-28T00:38:41Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-12T00:25:48Z","title":"Grothendieck Graph Neural Networks Framework: An Algebraic Platform for Crafting Topology-Aware GNNs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T07:22:21.682373Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2412.08835"},"observation_digest":"sha256:c1bf48be018dd39d0d814dbcbccf699d06a41ddf02371a2dd182a295a9793477","observation_id":"c00f15ad-d871-4fea-bdfc-0f00090dc0ef","resolution":{"observed_at":"2026-05-23T07:22:42.979640Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-07T12:45:04.612182Z","title":"Dwivedi, V","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.24067","last_updated":"2025-05-29T23:20:07Z","snapshot_observed_at":"2026-08-07T12:33:55.915444Z","submitted_at":"2025-05-29T23:20:07Z","title":"Primal-Dual Neural Algorithmic Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:04.612182Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2505.24067"},"observation_digest":"sha256:8950af322d6d8cfc4c03fed2e09f94533d9048dc7b8f62692e3c73106e492efa","observation_id":"f3a445ae-71d9-4eeb-87df-a6d72ce9f2db","resolution":{"observed_at":"2026-08-07T12:45:04.612182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2506.08618","last_updated":"2026-05-17T13:36:20Z","snapshot_observed_at":"2026-07-06T21:39:37.528649Z","submitted_at":"2025-06-10T09:25:19Z","title":"HSG-12M: A Large-Scale Benchmark of Spatial Multigraphs from the Energy Spectra of Non-Hermitian Crystals","version":4},"reference_index":135,"source":"pdf_text","source_observed_at":"2026-05-19T10:49:39.186387Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2506.08618"},"observation_digest":"sha256:e615280563b10c4e9347248d35ef477a497356d85bd0a3e540c095f2f518a16b","observation_id":"ddaaea9e-c43c-4a94-aac7-17692c2c0de1","resolution":{"observed_at":"2026-05-19T10:52:15.154817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2506.08618","last_updated":"2026-05-17T13:36:20Z","snapshot_observed_at":"2026-07-06T21:39:37.528649Z","submitted_at":"2025-06-10T09:25:19Z","title":"HSG-12M: A Large-Scale Benchmark of Spatial Multigraphs from the Energy Spectra of Non-Hermitian Crystals","version":5},"reference_index":135,"source":"pdf_text","source_observed_at":"2026-05-21T23:52:40.011346Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2506.08618"},"observation_digest":"sha256:1752056e8080c462361f11b558c8c2b9b898eb3bdaa52d8612a22e598799876a","observation_id":"9fbf207d-a692-4eee-904f-40308e28e83b","resolution":{"observed_at":"2026-05-21T23:54:28.521650Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-07T01:03:48.165338Z","title":"P ., Joshi, C","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.12226","last_updated":"2025-06-13T21:03:49Z","snapshot_observed_at":"2026-08-07T00:52:51.178163Z","submitted_at":"2025-06-13T21:03:49Z","title":"Learning Causality for Modern Machine Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T01:03:48.165338Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2506.12226"},"observation_digest":"sha256:f34da1cefa90084b6a9a20ff4704e14118aec46160e59c72d7367d359721cc6b","observation_id":"1dcb9df6-1ee0-416c-a7b3-4014997c411e","resolution":{"observed_at":"2026-08-07T01:03:48.165338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-07T00:23:44.128907Z","title":"Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.14438","last_updated":"2025-06-17T11:58:07Z","snapshot_observed_at":"2026-08-07T00:15:30.334738Z","submitted_at":"2025-06-17T11:58:07Z","title":"sHGCN: Simplified hyperbolic graph convolutional neural networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:23:44.128907Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2506.14438"},"observation_digest":"sha256:d83e3e7ec26b0516e2111c1257ab5dc5fb12e024297e0c07a5ef9170b68da913","observation_id":"cfa93ea0-93d5-48e0-96e7-a127cb3b5004","resolution":{"observed_at":"2026-08-07T00:23:44.128907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-06T19:08:27.863764Z","title":"Benchmarking graph neural networks,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.06538","last_updated":"2025-07-09T04:42:18Z","snapshot_observed_at":"2026-08-06T18:58:32.707668Z","submitted_at":"2025-07-09T04:42:18Z","title":"Few-shot Learning on AMS Circuits and Its Application to Parasitic Capacitance Prediction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:08:27.863764Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2507.06538"},"observation_digest":"sha256:eaf68fae963db484f23b90c7cd5b932ed2cef649f51478642a0eb1c09b8b628f","observation_id":"4538745d-77c0-48ba-aa57-2972ecc5c03c","resolution":{"observed_at":"2026-08-06T19:08:27.863764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-04T11:01:20.439905Z","title":"Benchmarking graph neural networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-07T16:47:16.463770Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.439905Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:4c62e882730e3771e110b392e1b1eef9502e8618d3c15ecc0d518dfc8f5eacda","observation_id":"9a2fae09-773c-406a-be14-9ed08029e20b","resolution":{"observed_at":"2026-08-04T11:01:20.439905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2604.07492","last_updated":"2026-04-08T18:33:29Z","snapshot_observed_at":"2026-07-06T22:55:41.978450Z","submitted_at":"2026-04-08T18:33:29Z","title":"Cluster Attention for Graph Machine Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:56:17.261423Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2604.07492"},"observation_digest":"sha256:ec2c0c7e6f5055e5a114b72de751db4f9e12fb7ea9779e2db646f6e00c7f1d3d","observation_id":"b6fedd48-9507-4545-bf52-978fb781abcd","resolution":{"observed_at":"2026-05-11T05:51:00.364541Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2604.08810","last_updated":"2026-04-09T22:59:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-09T22:59:27Z","title":"R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T17:01:41.339487Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2604.08810"},"observation_digest":"sha256:ac5c2ae3c292d43bc2737a869adfbddbef341d39dbc6e06be77d0decc9854154","observation_id":"f29858d8-0ddb-4936-8b68-198e925f0d89","resolution":{"observed_at":"2026-05-11T07:41:01.284099Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2604.15273","last_updated":"2026-04-16T17:45:24Z","snapshot_observed_at":"2026-07-06T23:02:53.677687Z","submitted_at":"2026-04-16T17:45:24Z","title":"How Embeddings Shape Graph Neural Networks: Classical vs Quantum-Oriented Node Representations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T12:15:43.914184Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2604.15273"},"observation_digest":"sha256:1384aa42142f9e87513e39505dbee79caee23d50449185e5df557687284b2c05","observation_id":"e7658510-7ab0-4dd7-9b9f-b5ddf754e3be","resolution":{"observed_at":"2026-05-10T12:20:22.932686Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2605.05689","last_updated":"2026-05-07T05:29:57Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:29:57Z","title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T11:46:42.010486Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2605.05689"},"observation_digest":"sha256:f88888d64db378480c7fc12c6f142622b6601fbfb5cfce39ce592363d0bfd2f0","observation_id":"d367e920-ad24-47c7-8fad-ff15a63b8886","resolution":{"observed_at":"2026-05-11T19:31:08.959676Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2605.09226","last_updated":"2026-05-09T23:51:46Z","snapshot_observed_at":"2026-07-30T07:00:40.739802Z","submitted_at":"2026-05-09T23:51:46Z","title":"Quantum Injection Pathways for Implicit Graph Neural Networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-12T02:31:34.776537Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2605.09226"},"observation_digest":"sha256:8ea8aac1b8348e93cef71977393e789451bad845a91274a6391be180d1bd9aba","observation_id":"1a14ab5d-80ac-4740-8d1c-f157a68eec81","resolution":{"observed_at":"2026-05-12T02:36:17.288269Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2605.23708","last_updated":"2026-05-22T14:55:09Z","snapshot_observed_at":"2026-08-02T20:22:51.655037Z","submitted_at":"2026-05-22T14:55:09Z","title":"Learning Dynamic Stability Landscapes in Synchronization Networks","version":1},"reference_index":176,"source":"arxiv_source","source_observed_at":"2026-05-25T05:04:16.957305Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2605.23708"},"observation_digest":"sha256:f8a10b95d6adbe1782d4e7f99994290976c64f8b29aa47d62470d5d983e5f7b7","observation_id":"9b5b08cc-079d-48c7-b0fd-3e435c6ad65d","resolution":{"observed_at":"2026-05-25T05:05:22.685579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2605.30470","last_updated":"2026-05-28T18:41:20Z","snapshot_observed_at":"2026-08-02T00:40:58.268658Z","submitted_at":"2026-05-28T18:41:20Z","title":"Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T08:32:47.166531Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2605.30470"},"observation_digest":"sha256:7191bbd703ee0465019abca642b740e43a222001126a14de2da706941de5c3c7","observation_id":"798e6b8d-56d4-41ce-9fb4-23e47f990dd1","resolution":{"observed_at":"2026-06-29T08:33:14.880370Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2003.00982","doi":"10.48550/arxiv.2003.00982","metadata_source":"arxiv_reference","pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Laurent, Thomas and Bengio, Yoshua and Bresson, Xavier , year = 2020, month = jul, journal =","venue":"arXiv (Cornell University)","work_id":"87ffefbd-0e09-41bb-a247-fbc87d8d365e","year":2003},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-08-07T18:47:13.612767Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":115,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:3383f941d9a31772fa8caf322fc18bd17c1d8862bd0a2b35d9a1dfbcffde05c1","observation_id":"ea953a63-b3e0-422b-bbaf-0982c6c97127","resolution":{"observed_at":"2026-07-04T08:49:41.996064Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-03T13:30:08.393805Z","title":"arXiv preprint arXiv:2003.00982 , year=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.29115","last_updated":"2026-07-31T07:44:11Z","snapshot_observed_at":"2026-08-06T23:19:49.794098Z","submitted_at":"2026-07-31T07:44:11Z","title":"Multi-Granularity Position Embedding of Graphs via Granular-Ball for Link Prediction","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-03T13:30:08.393805Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2607.29115"},"observation_digest":"sha256:59ec815df14ff9e0f519de897b185707390e4f39490dc731ec69b284c9c23d34","observation_id":"9857901f-16ad-45d1-bb8e-406e0ce6d793","resolution":{"observed_at":"2026-08-03T13:30:08.393805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2003.00982/citation-record","integrity":"/paper/2003.00982/integrity","json":"/paper/2003.00982/citation-record.json","paper":"/paper/2003.00982"},"outbound":[],"paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:00:11.035143Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2003.00982."}