{"as_of":"2026-08-21T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3745dac006d173784b0831f0ec549f3d2edb1942779d6bdbb11ca63d5545df8d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:04:08.132753Z","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-11T19:01:37.470992Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.11876","last_updated":"2024-09-02T09:49:49Z","snapshot_observed_at":"2026-08-16T13:33:41.976314Z","submitted_at":"2024-07-16T16:00:42Z","title":"Simplifying the Theory on Over-Smoothing","version":2},"cited_work":{"arxiv_id":"2407.11876","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.11876","snapshot_observed_at":"2026-08-11T19:01:37.470992Z","title":"Simplifying the Theory on Over-Smoothing","venue":"cs.LG","work_id":"65dc079c-ebcd-4a34-82bf-0f22412f9110","year":2024},"citing_paper":{"arxiv_id":"2412.07243","last_updated":"2024-12-10T07:07:06Z","snapshot_observed_at":"2026-08-19T18:58:15.604329Z","submitted_at":"2024-12-10T07:07:06Z","title":"A Dynamical Systems-Inspired Pruning Strategy for Addressing Oversmoothing in Graph Neural Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T19:01:37.383417Z"},"links":{"cited_paper":"/paper/2407.11876","citing_paper":"/paper/2412.07243"},"observation_digest":"sha256:55a000b0b6be90d14c33076ac77bcb6f1c2ac3f374ac39aa2273e53699bcd258","observation_id":"a555038d-254e-44b2-93d7-fb9eb7f90eee","resolution":{"observed_at":"2026-08-11T19:01:37.476002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11876","last_updated":"2024-09-02T09:49:49Z","snapshot_observed_at":"2026-08-16T13:33:41.976314Z","submitted_at":"2024-07-16T16:00:42Z","title":"Simplifying the Theory on Over-Smoothing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11876","snapshot_observed_at":"2026-08-15T21:04:08.132753Z","title":"Simplifying the theory on over- smoothing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11346","last_updated":"2025-05-16T15:13:09Z","snapshot_observed_at":"2026-08-18T14:04:11.023103Z","submitted_at":"2025-05-16T15:13:09Z","title":"What Can We Learn From MIMO Graph Convolutions?","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:04:08.132753Z"},"links":{"cited_paper":"/paper/2407.11876","citing_paper":"/paper/2505.11346"},"observation_digest":"sha256:4766d3223bfb6b7190b4fb7525b2abb66ff7b6158af3b1cdb09e41955d572b18","observation_id":"5eb57617-2398-43f1-be36-2c033bc4bd08","resolution":{"observed_at":"2026-08-15T21:04:08.132753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11876","last_updated":"2024-09-02T09:49:49Z","snapshot_observed_at":"2026-08-16T13:33:41.976314Z","submitted_at":"2024-07-16T16:00:42Z","title":"Simplifying the Theory on Over-Smoothing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11876","snapshot_observed_at":"2026-08-15T19:24:57.557714Z","title":"Simplifying the theory on over-smoothing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16790","last_updated":"2025-07-15T05:21:45Z","snapshot_observed_at":"2026-08-19T18:08:58.374564Z","submitted_at":"2025-06-20T07:14:31Z","title":"Exploring and Improving Initialization for Deep Graph Neural Networks: A Signal Propagation Perspective","version":2},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-15T19:24:57.557714Z"},"links":{"cited_paper":"/paper/2407.11876","citing_paper":"/paper/2506.16790"},"observation_digest":"sha256:e5c80e59c0ac6f75ead2d016434d6e7695a1d4cb67d9a319b65326cd3902a319","observation_id":"1ee31bb3-4dc3-4609-ab79-44f0735c3400","resolution":{"observed_at":"2026-08-15T19:24:57.557714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.11876/citation-record","integrity":"/paper/2407.11876/integrity","json":"/paper/2407.11876/citation-record.json","paper":"/paper/2407.11876"},"outbound":[],"paper":{"arxiv_id":"2407.11876","last_updated":"2024-09-02T09:49:49Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:33:41.976314Z","submitted_at":"2024-07-16T16:00:42Z","title":"Simplifying the Theory on Over-Smoothing"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.11876."}