{"as_of":"2026-08-11T14:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4790b27d8fafb8a0476fc3f01189722df876f2623144d5345cd0fb3d557319a2","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:03:12.173842Z","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-04T08:49:41.988086Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-08-11T12:03:12.173842Z","title":"arXiv preprint arXiv:2008.09864","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.15302","last_updated":"2025-04-11T15:06:01Z","snapshot_observed_at":"2026-08-11T11:56:09.462476Z","submitted_at":"2024-12-19T10:44:18Z","title":"Tokenphormer: Structure-aware Multi-token Graph Transformer for Node Classification","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T12:03:12.173842Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2412.15302"},"observation_digest":"sha256:c2165918c1a0dc7ec31af789deb54125c132e03e883ce6b6e0e9c6357d443a35","observation_id":"0c46714d-a25f-47fd-8113-7f49bcafc45c","resolution":{"observed_at":"2026-08-11T12:03:12.173842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-08-08T20:29:46.991091Z","title":"Tackling over-smoothing for general graph convolutional networks,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-11T07:52:42.967248Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":244,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:46.991091Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:11b2e91507c00ea05fb8b89f700ba9da8e97d20b04b0f812bed2f95440eefd43","observation_id":"a20a5bcc-b39b-4546-903b-f9c060cefbe4","resolution":{"observed_at":"2026-08-08T20:29:46.991091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-08-08T19:48:59.164658Z","title":"Huang, Y","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.05334","last_updated":"2025-02-27T18:19:47Z","snapshot_observed_at":"2026-08-08T19:42:04.374074Z","submitted_at":"2025-02-07T21:14:48Z","title":"Geometric Machine Learning on EEG Signals","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T19:48:59.164658Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2502.05334"},"observation_digest":"sha256:0dc401b5b95a8d30d71bc2d0255aa3c6d8fc497f02c2d772e0a2d221340f8fca","observation_id":"053ac16a-3160-45d2-bf26-5182541e167e","resolution":{"observed_at":"2026-08-08T19:48:59.164658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":"2008.09864","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-07-04T08:49:41.988086Z","title":"Tackling","venue":null,"work_id":"f89dce40-330a-4f9c-9648-6b6545ccec12","year":2008},"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":178,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:e17a93e47e93d0e1dbb4633c8793f078776efe36ef8df5673573c21e76bb4bfb","observation_id":"87bfce35-eb18-4e44-91b7-b1b7dba53bf0","resolution":{"observed_at":"2026-07-04T08:49:41.990103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-08-01T22:29:30.378100Z","title":"Tackling over- smoothing for general graph convolutional networks,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.15773","last_updated":"2026-07-17T09:04:22Z","snapshot_observed_at":"2026-08-09T04:16:03.339300Z","submitted_at":"2026-07-17T09:04:22Z","title":"From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.378100Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2607.15773"},"observation_digest":"sha256:9c7035bdab3b99bbeff945a476f39906ea8e06d6f7014e8980bc4c60dafbec3a","observation_id":"68d1eea4-f416-475e-8866-f95ccf3f527b","resolution":{"observed_at":"2026-08-01T22:29:30.378100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.09864","snapshot_observed_at":"2026-08-01T00:45:52.647181Z","title":"arXiv preprint arXiv:2008.09864 , year=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.27826","last_updated":"2026-07-30T08:05:26Z","snapshot_observed_at":"2026-08-04T13:04:08.883511Z","submitted_at":"2026-07-30T08:05:26Z","title":"Sign Language Question Answering: A New Task, Benchmark, and Baseline for Sign Language Understanding","version":1},"reference_index":154,"source":"arxiv_source","source_observed_at":"2026-08-01T00:45:52.647181Z"},"links":{"cited_paper":"/paper/2008.09864","citing_paper":"/paper/2607.27826"},"observation_digest":"sha256:07a70e6f23a71eb8f6b973124dcda008f4cddb0df2da4c6113335992139a8028","observation_id":"fa6174fc-81e2-475d-9756-8b682838b2a7","resolution":{"observed_at":"2026-08-01T00:45:52.647181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2008.09864/citation-record","integrity":"/paper/2008.09864/integrity","json":"/paper/2008.09864/citation-record.json","paper":"/paper/2008.09864"},"outbound":[],"paper":{"arxiv_id":"2008.09864","last_updated":"2022-07-09T01:41:01Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:30:20.016396Z","submitted_at":"2020-08-22T16:14:01Z","title":"Tackling Over-Smoothing for General Graph Convolutional 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2008.09864."}