{"as_of":"2026-08-18T19:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64815234707ab18ca7023e9dabc69cab7fd22691fdd12c8a4822e703527f3d14","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:34:52.368829Z","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-05-13T18:58:08.775225Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.04329","last_updated":"2023-12-07T14:45:48Z","snapshot_observed_at":"2026-08-16T16:44:54.764541Z","submitted_at":"2023-12-07T14:45:48Z","title":"Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04329","snapshot_observed_at":"2026-08-16T11:34:52.368829Z","title":"Reed-Muller codes have vanishin g bit-error probability below capacity: a simple tighter pr oof via camellia boosting,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-17T14:48:26.054035Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:34:52.368829Z"},"links":{"cited_paper":"/paper/2312.04329","citing_paper":"/paper/2504.15394"},"observation_digest":"sha256:40f346fb5bf8b5389cb571ab8bfea39dc0aea9926ee59f3a1c3c2a600c64cd3d","observation_id":"b957840b-f3e4-4f52-9872-7ada166d630b","resolution":{"observed_at":"2026-08-16T11:34:52.368829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04329","last_updated":"2023-12-07T14:45:48Z","snapshot_observed_at":"2026-08-16T16:44:54.764541Z","submitted_at":"2023-12-07T14:45:48Z","title":"Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting","version":1},"cited_work":{"arxiv_id":"2312.04329","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04329","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reed-- M uller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting","venue":null,"work_id":"901f6d6a-e8d8-4cda-9a82-acef42f65f7e","year":2023},"citing_paper":{"arxiv_id":"2604.02994","last_updated":"2026-04-03T12:13:56Z","snapshot_observed_at":"2026-08-17T00:46:09.203071Z","submitted_at":"2026-04-03T12:13:56Z","title":"Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-13T18:54:49.513016Z"},"links":{"cited_paper":"/paper/2312.04329","citing_paper":"/paper/2604.02994"},"observation_digest":"sha256:e5a2e1de6b250da0bb315755d76b167fde3d2919914ac0f1c83235d85b68adf3","observation_id":"b554aa3e-2ba4-4b27-af74-38b109cea1fe","resolution":{"observed_at":"2026-05-13T18:58:08.777086Z","resolver_source":"arxiv_id","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/2312.04329/citation-record","integrity":"/paper/2312.04329/integrity","json":"/paper/2312.04329/citation-record.json","paper":"/paper/2312.04329"},"outbound":[],"paper":{"arxiv_id":"2312.04329","last_updated":"2023-12-07T14:45:48Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T16:44:54.764541Z","submitted_at":"2023-12-07T14:45:48Z","title":"Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting"},"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 2 inbound Pith citation observations for arXiv:2312.04329."}