{"as_of":"2026-08-08T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13ea91e87c154b4a0f7fb4968bf7a00729475f84b6b5f50d5612b7ade1e20f3d","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-08T06:32:00.761636+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-07T13:22:13.708937Z","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-07T05:18:21.811797Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14631","last_updated":"2023-06-13T17:54:55Z","snapshot_observed_at":"2026-07-06T12:02:42.908923Z","submitted_at":"2021-10-27T17:56:00Z","title":"Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14631","snapshot_observed_at":"2026-08-07T13:22:13.708937Z","title":"Reed-Muller codes achieve capacity on bms channels,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22142","last_updated":"2025-06-06T09:07:46Z","snapshot_observed_at":"2026-08-08T06:15:25.815022Z","submitted_at":"2025-05-28T09:04:02Z","title":"Interpolation of Quantum Polar Codes and Quantum Reed-Muller Codes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:22:13.708937Z"},"links":{"cited_paper":"/paper/2110.14631","citing_paper":"/paper/2505.22142"},"observation_digest":"sha256:9402318fa28e939184f9efb59cb7882e3376b41ae675090c6a5acf38d7eb1202","observation_id":"3f8d8f29-188c-4361-b527-6af211c507f0","resolution":{"observed_at":"2026-08-07T13:22:13.708937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14631","last_updated":"2023-06-13T17:54:55Z","snapshot_observed_at":"2026-07-06T12:02:42.908923Z","submitted_at":"2021-10-27T17:56:00Z","title":"Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity","version":3},"cited_work":{"arxiv_id":"2110.14631","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.14631","snapshot_observed_at":"2026-08-07T05:18:21.811797Z","title":"Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity","venue":"cs.IT","work_id":"1e4e1b25-b0ba-4f7e-91cf-610f31a45ad3","year":2021},"citing_paper":{"arxiv_id":"2506.08651","last_updated":"2025-06-10T10:02:57Z","snapshot_observed_at":"2026-08-07T05:02:56.313488Z","submitted_at":"2025-06-10T10:02:57Z","title":"Reed-Muller Codes for Quantum Pauli and Multiple Access Channels","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:18:20.207344Z"},"links":{"cited_paper":"/paper/2110.14631","citing_paper":"/paper/2506.08651"},"observation_digest":"sha256:dcabe05e1ca0c46004c7163a13e36c464e52a35ffdf3be93bdbc274c94df062a","observation_id":"3d1eae0b-92b9-4abe-bc85-35309c4b24ba","resolution":{"observed_at":"2026-08-07T05:18:21.865772Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14631/citation-record","integrity":"/paper/2110.14631/integrity","json":"/paper/2110.14631/citation-record.json","paper":"/paper/2110.14631"},"outbound":[],"paper":{"arxiv_id":"2110.14631","last_updated":"2023-06-13T17:54:55Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T12:02:42.908923Z","submitted_at":"2021-10-27T17:56:00Z","title":"Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.14631."}