{"as_of":"2026-08-10T18:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a47b7feed306301b058b8d2c73efb9041a328476f3cbe204c1631244507599a","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":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:23:13.157177Z","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-07-03T00:17:29.143256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2501.00773","last_updated":"2026-04-09T14:25:52Z","snapshot_observed_at":"2026-08-02T06:24:28.654744Z","submitted_at":"2025-01-01T08:48:53Z","title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T06:10:49.711018Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2501.00773"},"observation_digest":"sha256:b600585ec74ced6609bc82431a1846be7b67d560846b20347a86a2ef4136350c","observation_id":"70fe47a1-b535-4bea-8269-b6667e8aba87","resolution":{"observed_at":"2026-05-23T06:12:38.374113Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-07T14:23:13.157177Z","title":"A fair comparison of graph neural networks for graph classification.arXiv preprint arXiv:1912.09893, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2505.19188","last_updated":"2025-05-25T15:25:56Z","snapshot_observed_at":"2026-08-09T07:22:07.076914Z","submitted_at":"2025-05-25T15:25:56Z","title":"Chordless Structure: A Pathway to Simple and Expressive GNNs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:23:13.157177Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2505.19188"},"observation_digest":"sha256:18c22017c5522de32c47baf9961a4e919988d50bd36c0b14606497b63ca7315a","observation_id":"ee4a167f-8289-4e14-abd6-c5e949735a13","resolution":{"observed_at":"2026-08-07T14:23:13.157177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-07T12:16:48.827618Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.00191","last_updated":"2025-05-30T20:02:43Z","snapshot_observed_at":"2026-08-08T14:02:51.142502Z","submitted_at":"2025-05-30T20:02:43Z","title":"Heterogeneous Graph Backdoor Attack","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:16:48.827618Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.00191"},"observation_digest":"sha256:0ee4928cf62200601113ef0db406cb3b2c4ba4bdc6efe800de18b98bbb424b2f","observation_id":"c480ffdd-5345-4c16-bf6f-fbcca5235198","resolution":{"observed_at":"2026-08-07T12:16:48.827618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"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":9,"source":"pdf_text","source_observed_at":"2026-05-19T10:49:39.186387Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.08618"},"observation_digest":"sha256:50343dcb605202e5663171d29438bb315a4d4dcca29231d27422aaf322a3f1d0","observation_id":"53531a45-c2b3-41da-8732-53984bd3d847","resolution":{"observed_at":"2026-05-19T10:52:15.163040Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"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":9,"source":"pdf_text","source_observed_at":"2026-05-21T23:52:40.011346Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.08618"},"observation_digest":"sha256:4e062a66f5cd227ad15ab576cd0cc16b6123f4b0ccbcc4b0b7ed6d8710ecb3a1","observation_id":"d63bca2b-e639-46df-9826-f2905df1989c","resolution":{"observed_at":"2026-05-21T23:54:28.540057Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-07T01:07:34.769782Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.11869","last_updated":"2025-08-22T19:08:50Z","snapshot_observed_at":"2026-08-10T12:52:01.547604Z","submitted_at":"2025-06-13T15:19:28Z","title":"How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:34.769782Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.11869"},"observation_digest":"sha256:68e8027b32ad4b6451693ef47ab1fb4ff912649443355bc3c2886ffde1bcb9da","observation_id":"7d9c1a62-20b2-442e-874f-2ed686232905","resolution":{"observed_at":"2026-08-07T01:07:34.769782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-06T22:15:45.422882Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22292","last_updated":"2025-06-27T15:04:09Z","snapshot_observed_at":"2026-08-06T22:04:55.315981Z","submitted_at":"2025-06-27T15:04:09Z","title":"Scalable inference of large-scale random kronecker graphs via tensor decomposition and Einstein summation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:15:45.422882Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.22292"},"observation_digest":"sha256:a2ff8fc1289dce72b96054358684b73c016f6b99c3487b5649c168688fcbe5f2","observation_id":"e56e962e-84af-4c34-a844-47b63100c0eb","resolution":{"observed_at":"2026-08-06T22:15:45.422882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-06T21:35:07.884976Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.884976Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:3d10c7a70a505ae93cf9bfe9599b2eb9a3ed549fb8583346e9f413886635ca55","observation_id":"743a3aaa-d506-4690-8787-17d351d3fc2f","resolution":{"observed_at":"2026-08-06T21:35:07.884976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-06T19:29:07.383382Z","title":"A fair comparison of graph neural networks for graph classification.arXiv preprint arXiv:1912.09893, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.05640","last_updated":"2025-07-11T15:46:42Z","snapshot_observed_at":"2026-08-08T10:53:57.135696Z","submitted_at":"2025-07-08T03:36:40Z","title":"Learnable quantum spectral filters for hybrid graph neural networks","version":2},"reference_index":106,"source":"pdf_text","source_observed_at":"2026-08-06T19:29:07.383382Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2507.05640"},"observation_digest":"sha256:86a648267960adf88085af603f8e65d669b4e8fdd6baeac15a0b392ae44fc39d","observation_id":"0b0d7efd-ab58-4a52-8a52-376a1f6a11c6","resolution":{"observed_at":"2026-08-06T19:29:07.383382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2512.08089","last_updated":"2026-05-18T17:55:20Z","snapshot_observed_at":"2026-08-07T08:38:45.387231Z","submitted_at":"2025-12-08T22:47:39Z","title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T17:15:05.806029Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2512.08089"},"observation_digest":"sha256:b65dce5f7192b971e4ca2def935114730ee2a2bf0d1967eacbbaac15670d9a79","observation_id":"4c2eb71c-6943-4e38-aff6-c0790d2fb0a0","resolution":{"observed_at":"2026-05-21T17:15:25.323678Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2605.09486","last_updated":"2026-05-10T11:45:25Z","snapshot_observed_at":"2026-08-02T12:12:15.613572Z","submitted_at":"2026-05-10T11:45:25Z","title":"CTQWformer: A CTQW-based Transformer for Graph Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-12T04:16:35.396260Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2605.09486"},"observation_digest":"sha256:30f2b504d4c11cd543b63f3e45fceaf47480ed6f0a2373c827e52714d1423345","observation_id":"ea65eead-1883-400d-a0b0-9f558c06662f","resolution":{"observed_at":"2026-05-12T06:26:25.752360Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2605.17854","last_updated":"2026-05-18T04:52:07Z","snapshot_observed_at":"2026-08-07T12:12:40.899437Z","submitted_at":"2026-05-18T04:52:07Z","title":"Learning over Positive and Negative Edges with Contrastive Message Passing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T12:31:19.969760Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2605.17854"},"observation_digest":"sha256:0f0f5b9cf826b00741bc76f7887b0375880493735edf49b5967006b9f7751890","observation_id":"a4144bbf-2593-47f3-8462-1606ff3a182d","resolution":{"observed_at":"2026-05-20T12:33:16.847741Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2605.30786","last_updated":"2026-05-29T03:21:14Z","snapshot_observed_at":"2026-07-06T23:40:03.151978Z","submitted_at":"2026-05-29T03:21:14Z","title":"AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T23:57:04.040633Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2605.30786"},"observation_digest":"sha256:6c41a06c5456e7359896b8389f0f53aeaa33fdf72197c7fe4fb49f6b4b97c854","observation_id":"4f2fd519-1b55-40eb-865f-a10e138317a8","resolution":{"observed_at":"2026-06-29T00:02:49.807565Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":"1912.09893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-03T00:17:29.143256Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":"d564d765-10bc-4f53-8801-a6b8cc0f822a","year":1912},"citing_paper":{"arxiv_id":"2606.09051","last_updated":"2026-06-08T05:40:19Z","snapshot_observed_at":"2026-07-06T23:48:26.076260Z","submitted_at":"2026-06-08T05:40:19Z","title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:28.096446Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2606.09051"},"observation_digest":"sha256:ea1d79d70649363ba3a4bbdb0cadf9da8f7e1ca1bbd16a09d887ad6af023b73a","observation_id":"4548ee6a-62b9-42df-9abd-fc127815b21d","resolution":{"observed_at":"2026-07-03T00:17:29.145164Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-07-31T18:33:46.589286Z","title":"& Micheli, A","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.24314","last_updated":"2026-07-27T11:58:56Z","snapshot_observed_at":"2026-08-06T10:05:58.179598Z","submitted_at":"2026-07-27T11:58:56Z","title":"MEGA-CL: A Molecular Foundation Model for Generalizable ADMET Prediction through Graph External Attention and Contrastive Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T18:33:46.589286Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2607.24314"},"observation_digest":"sha256:2b3cc56dc803f33f0f7ee69c33ab835f7a42b46400562e2b0326ec0a68d36fff","observation_id":"6b3dab5d-5d19-4940-b761-3f4ba06e3397","resolution":{"observed_at":"2026-07-31T18:33:46.589286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-04T04:52:31.889191Z","title":"Fiorini, S.; Aktas, H.; Duta, I.; Coniglio, S.; Morerio, P.; Del Bue, A.; and Liò, P","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2608.02558","last_updated":"2026-08-03T17:41:20Z","snapshot_observed_at":"2026-08-09T01:41:31.111510Z","submitted_at":"2026-08-03T17:41:20Z","title":"Benchmarking Sheaf Neural Networks for Inductive Tasks","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T04:52:31.889191Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2608.02558"},"observation_digest":"sha256:f490500168e99301588d67b141efed61c68bb919e0cfc0f9856c40abd42828e1","observation_id":"a2bc7e98-a69c-47f7-a36d-fd1a6f4bca3c","resolution":{"observed_at":"2026-08-04T04:52:31.889191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.09893/citation-record","integrity":"/paper/1912.09893/integrity","json":"/paper/1912.09893/citation-record.json","paper":"/paper/1912.09893"},"outbound":[],"paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification"},"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 16 inbound Pith citation observations for arXiv:1912.09893."}