{"as_of":"2026-08-21T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4543d31d7ddf95e105d5c52b58626dd0b78ddc74530833571f53159703e54435","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:22:58.582374Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.10391","last_updated":"2025-01-09T01:09:42Z","snapshot_observed_at":"2026-08-16T15:32:16.146324Z","submitted_at":"2023-05-17T17:31:20Z","title":"Optimality of Message-Passing Architectures for Sparse Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10391","snapshot_observed_at":"2026-08-01T20:22:58.582374Z","title":"Optimality of message- passing architectures for sparse graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16676","last_updated":"2026-07-18T07:11:45Z","snapshot_observed_at":"2026-08-06T08:55:21.729874Z","submitted_at":"2026-07-18T07:11:45Z","title":"The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T20:22:58.582374Z"},"links":{"cited_paper":"/paper/2305.10391","citing_paper":"/paper/2607.16676"},"observation_digest":"sha256:674a94a273585a1d08d178ef6b408a27170a8f544e561a0e83dc4cccc7395e2a","observation_id":"670899dc-82cd-47fc-a8d2-167a5cb77b6d","resolution":{"observed_at":"2026-08-01T20:22:58.582374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.10391/citation-record","integrity":"/paper/2305.10391/integrity","json":"/paper/2305.10391/citation-record.json","paper":"/paper/2305.10391"},"outbound":[],"paper":{"arxiv_id":"2305.10391","last_updated":"2025-01-09T01:09:42Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:32:16.146324Z","submitted_at":"2023-05-17T17:31:20Z","title":"Optimality of Message-Passing Architectures for Sparse Graphs"},"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 1 inbound Pith citation observation for arXiv:2305.10391."}