{"as_of":"2026-08-10T01:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5a833549f27df2916fd575b38abb21fc1ed87c308ef4964ae6aa90255d87871","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:19:11.672426Z","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":25,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":"2102.06462","doi":"10.48550/arxiv.2102.06462","metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":"arXiv (Cornell University)","work_id":"838c4711-d405-469b-bf3e-83e94a018af3","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":32,"source":"pdf_text","source_observed_at":"2026-05-24T12:16:28.254450Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2202.07082"},"observation_digest":"sha256:b1677ea5e8a5ac09e42844ac80ae6d16891605133015403e5926ab77e3779d29","observation_id":"7463855a-074e-40a9-a843-fa8c54b09675","resolution":{"observed_at":"2026-05-24T12:19:27.080401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":"2102.06462","doi":"10.48550/arxiv.2102.06462","metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":"arXiv (Cornell University)","work_id":"838c4711-d405-469b-bf3e-83e94a018af3","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":21,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:782244e27abc4c9f9e8c79f3071d34470ab7f6ff8a1e0a33641357da4a85fce1","observation_id":"a765188a-2ced-40dd-bc56-2ed2fabae5d1","resolution":{"observed_at":"2026-05-24T08:46:05.596618Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T13:19:11.672426Z","title":"arXiv:2102.06462 [cs.LG] https://arxiv.org/abs/ 2102.06462","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00772","last_updated":"2025-08-31T10:03:15Z","snapshot_observed_at":"2026-08-07T06:27:59.198185Z","submitted_at":"2025-08-31T10:03:15Z","title":"Flow Matters: Directional and Expressive GNNs for Heterophilic Graphs","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T13:19:11.672426Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2509.00772"},"observation_digest":"sha256:abbf7bde91685d8f9938067148cf83d463c914c6517d0af39d54f3f75fd2f0fa","observation_id":"2e07ee51-5caf-41d3-85ba-3572be7e65fb","resolution":{"observed_at":"2026-08-05T13:19:11.672426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":"2102.06462","doi":"10.48550/arxiv.2102.06462","metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":"arXiv (Cornell University)","work_id":"838c4711-d405-469b-bf3e-83e94a018af3","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":121,"source":"arxiv_source","source_observed_at":"2026-05-09T15:09:03.417040Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2605.01484"},"observation_digest":"sha256:c88c7a982cdb42d41b4e01e3c290482b758afe85aef2a89848ce1f918de4b30b","observation_id":"208dfd9d-b099-4b88-8883-7bf81341ccd8","resolution":{"observed_at":"2026-05-09T22:13:57.696356Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":"2102.06462","doi":"10.48550/arxiv.2102.06462","metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":"arXiv (Cornell University)","work_id":"838c4711-d405-469b-bf3e-83e94a018af3","year":2021},"citing_paper":{"arxiv_id":"2606.32016","last_updated":"2026-06-30T17:47:39Z","snapshot_observed_at":"2026-07-07T00:05:37.068846Z","submitted_at":"2026-06-30T17:47:39Z","title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-01T06:10:26.634933Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2606.32016"},"observation_digest":"sha256:443e3e762d2b8f54cc1c1c4908c34073d2f1f84d2398100fc369e4f64e9a22f3","observation_id":"64754dd2-88fe-47aa-bf1a-f94c4607419a","resolution":{"observed_at":"2026-07-01T09:45:40.699698Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.06462/citation-record","integrity":"/paper/2102.06462/integrity","json":"/paper/2102.06462/citation-record.json","paper":"/paper/2102.06462"},"outbound":[],"paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","latest_version":8,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T21:26:49.613152Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2102.06462."}