{"as_of":"2026-08-06T08:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc866f9e4d9789067d20ef264d233a4a58593243e2bd1b9bbbe5b2e35f314330","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:00:51.609973Z","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":44,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2202.07082","last_updated":"2026-04-18T08:18:16Z","snapshot_observed_at":"2026-08-02T07:00:41.767213Z","submitted_at":"2022-02-14T23:07:47Z","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T12:16:28.254450Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2202.07082"},"observation_digest":"sha256:af5d156c7afc6dd69fea23a421a9ae8d29b157d4a5afe2f7b896042e59c5ee62","observation_id":"b222723f-dc0a-4c33-9bf4-993ccf871737","resolution":{"observed_at":"2026-05-24T12:19:27.067950Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-03T05:37:30.342934Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:30499779a29c2c1eb79777352bfc800de3e74434504c993dd749f6d7a73b6997","observation_id":"4f4ab57c-a739-4046-adfb-216a0cb03f98","resolution":{"observed_at":"2026-05-24T08:46:05.567538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2411.17429","last_updated":"2026-05-01T11:43:42Z","snapshot_observed_at":"2026-07-06T19:57:18.481261Z","submitted_at":"2024-11-26T13:38:12Z","title":"Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-23T16:38:04.382748Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2411.17429"},"observation_digest":"sha256:e9e92ac58e7e602bbd641221a4579f82811c312b2f247e97243f1ec630d8b9bc","observation_id":"37c11dc7-cfe3-4a92-ac13-55fbf2c5495c","resolution":{"observed_at":"2026-05-23T16:38:11.165308Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T16:00:51.609973Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.19071","last_updated":"2025-08-28T09:15:01Z","snapshot_observed_at":"2026-08-05T16:00:50.489252Z","submitted_at":"2025-08-26T14:28:31Z","title":"Dynamic Triangulation-Based Graph Rewiring for Graph Neural Networks","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T16:00:51.609973Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2508.19071"},"observation_digest":"sha256:fcfa50047ddf28da1ef3d5bc19ff1ab0fb0caa16811888a7d784220d18053152","observation_id":"ab4ca057-2db1-4403-a08e-bb341b0aba53","resolution":{"observed_at":"2026-08-05T16:00:51.609973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2605.01484","last_updated":"2026-05-02T15:11:52Z","snapshot_observed_at":"2026-08-02T04:58:06.359776Z","submitted_at":"2026-05-02T15:11:52Z","title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","version":1},"reference_index":130,"source":"arxiv_source","source_observed_at":"2026-05-09T15:09:03.417040Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2605.01484"},"observation_digest":"sha256:4546a189288b15fe7af589b7b7e152f1938b85353bcb353715498294ec2722b9","observation_id":"488fe9b5-e5f2-481e-94b6-c0de73549c6a","resolution":{"observed_at":"2026-05-09T22:13:57.582354Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2605.08679","last_updated":"2026-05-09T04:33:14Z","snapshot_observed_at":"2026-08-02T13:27:25.888990Z","submitted_at":"2026-05-09T04:33:14Z","title":"Attention-based graph neural networks: a survey","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-12T01:07:43.805485Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2605.08679"},"observation_digest":"sha256:8c705e708a7d262453b8e5285b71173d4392c78ca6cafa62a6019bd60243f399","observation_id":"9fc671e9-5a80-4cdf-a890-7e2c08bf67a1","resolution":{"observed_at":"2026-05-12T08:26:24.914441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-07-06T23:57:18.596834Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":248,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:b13cfe830cf94fedff3626b479755efda5a6c7c9be5ebf6acedd9a713df4c98d","observation_id":"d9180238-12bb-4c0c-86fa-bce019de178a","resolution":{"observed_at":"2026-06-26T11:09:23.790622Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-07-31T04:39:46.846491Z","title":"arXiv preprint arXiv:2109.05641 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28525","last_updated":"2026-07-30T17:01:20Z","snapshot_observed_at":"2026-08-03T00:12:16.079391Z","submitted_at":"2026-07-30T17:01:20Z","title":"Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T04:39:46.846491Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2607.28525"},"observation_digest":"sha256:7a9bf7db174866eeed5627c69e6cb1500e089a044c79614cb689613fbba569e1","observation_id":"aeb749a0-d5df-470a-9121-2875480092a6","resolution":{"observed_at":"2026-07-31T04:39:46.846491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2109.05641/citation-record","integrity":"/paper/2109.05641/integrity","json":"/paper/2109.05641/citation-record.json","paper":"/paper/2109.05641"},"outbound":[],"paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:46:50.543914Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node 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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2109.05641."}