{"as_of":"2026-08-18T21:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:455f12ecf7f635f25dd458deb4a8a2e1614fe2611f4f7489667c46ff2832dc99","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-18T06:34:40.430872+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-16T04:40:07.402452Z","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-16T04:40:07.669309Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.02509","last_updated":"2023-04-05T15:31:55Z","snapshot_observed_at":"2026-08-18T20:11:53.847603Z","submitted_at":"2023-04-05T15:31:55Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels","version":1},"cited_work":{"arxiv_id":"2304.02509","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.02509","snapshot_observed_at":"2026-08-16T04:40:07.669309Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels","venue":"cs.IT","work_id":"9656ac5d-19d5-4a38-92dd-a93578aa0a42","year":2023},"citing_paper":{"arxiv_id":"2505.00974","last_updated":"2025-05-02T03:30:16Z","snapshot_observed_at":"2026-08-16T04:28:02.392640Z","submitted_at":"2025-05-02T03:30:16Z","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T04:40:07.402452Z"},"links":{"cited_paper":"/paper/2304.02509","citing_paper":"/paper/2505.00974"},"observation_digest":"sha256:9ebeaebeb14efe4cf9e89817e5bdc5c8a0b0408a439446251e9266b27e8d856a","observation_id":"04c3681b-8c78-4909-a94d-c5f24a0f8ad8","resolution":{"observed_at":"2026-08-16T04:40:07.674938Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.02509/citation-record","integrity":"/paper/2304.02509/integrity","json":"/paper/2304.02509/citation-record.json","paper":"/paper/2304.02509"},"outbound":[],"paper":{"arxiv_id":"2304.02509","last_updated":"2023-04-05T15:31:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T20:11:53.847603Z","submitted_at":"2023-04-05T15:31:55Z","title":"A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2304.02509."}