{"as_of":"2026-08-12T12:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0b502678479ec53fe59bbf29af9e6e1eefac69ba19d98d815bad6dca454e21f","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-12T06:34:41.77262+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-11T13:00:03.531100Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:23:13.415593Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-11T13:00:03.531100Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13754","last_updated":"2024-12-18T11:44:19Z","snapshot_observed_at":"2026-08-11T12:47:31.577903Z","submitted_at":"2024-12-18T11:44:19Z","title":"Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T13:00:03.531100Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2412.13754"},"observation_digest":"sha256:9c35962f80bea81c2b250880d6e3c4faad5bc12abc17849da169268328655499","observation_id":"d315e25a-eab8-4b0b-8cb1-78dd85a33725","resolution":{"observed_at":"2026-08-11T13:00:03.531100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-11T11:32:21.829688Z","title":"A non-asymptotic analysis of oversmoothing in graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-11T11:20:46.297652Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.829688Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:482431fdea5b7c5d42a5d79a6dc4042f4c6493cf7fc66e42fda7efbffc8d4e8f","observation_id":"64f069ac-100f-4c22-8437-ac065944a69f","resolution":{"observed_at":"2026-08-11T11:32:21.829688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-10T22:52:33.626180Z","title":"A non-asymptotic analysis of oversmoothing in graph neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00658","last_updated":"2025-03-11T03:58:57Z","snapshot_observed_at":"2026-08-12T06:36:12.188779Z","submitted_at":"2024-12-31T22:06:39Z","title":"Understanding and Mitigating Bottlenecks of State Space Models through the Lens of Recency and Over-smoothing","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:33.626180Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2501.00658"},"observation_digest":"sha256:672a656ec9344ccc3a3555890dd36e8d118ac90c13096a5446fb3fc0a81b92cc","observation_id":"ff99a6c3-f4c5-4123-957e-d1daa19e3488","resolution":{"observed_at":"2026-08-10T22:52:33.626180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-09T21:29:27.891714Z","title":"A non-asymptotic analysis of oversmoothing in graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.19089","last_updated":"2025-05-16T21:51:27Z","snapshot_observed_at":"2026-08-10T06:37:19.673594Z","submitted_at":"2025-01-31T12:34:09Z","title":"Resolving Oversmoothing with Opinion Dissensus","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T21:29:27.891714Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2501.19089"},"observation_digest":"sha256:c40c8f49e220d2c088072aed3e38e62b96033a85a852701a8a3e834cb9048144","observation_id":"b9818c97-630e-45f3-b6df-d5b95666e21b","resolution":{"observed_at":"2026-08-09T21:29:27.891714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2212.10701","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.10701","snapshot_observed_at":"2026-08-07T14:23:13.415593Z","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","venue":"cs.LG","work_id":"7bd8fdc0-8766-4d02-8a4f-5210d8c84ba4","year":2022},"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":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:23:13.291259Z"},"links":{"cited_paper":"/paper/2212.10701","citing_paper":"/paper/2505.19188"},"observation_digest":"sha256:4d4c0b902575f2f8a9c89b7a3b14d9aab3de97f981c18f9850fdceaf70d55cfb","observation_id":"4c9195be-2a94-4ea8-aa68-69e4e3deb947","resolution":{"observed_at":"2026-08-07T14:23:13.422117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.10701/citation-record","integrity":"/paper/2212.10701/integrity","json":"/paper/2212.10701/citation-record.json","paper":"/paper/2212.10701"},"outbound":[],"paper":{"arxiv_id":"2212.10701","last_updated":"2023-03-01T04:22:54Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T14:33:16.914984Z","submitted_at":"2022-12-21T00:33:59Z","title":"A Non-Asymptotic Analysis of Oversmoothing in 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2212.10701."}