{"as_of":"2026-08-18T20:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f43457f5917ea08e29c6c859d129975744a84bae3e9913af69a78ed0cce2c0b","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T08:36:09.271651Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.05816/citation-record","integrity":"/paper/2607.05816/integrity","json":"/paper/2607.05816/citation-record.json","paper":"/paper/2607.05816"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:07.911651Z","title":"A mathematical theory of communi- cation,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:07.911651Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:063e576a4ec4a428840bed400a2b3a591aaea7084bb544b4bbcc4d65ccd1d625","observation_id":"de0573ab-c7e1-4bfd-b2a5-4cb081b5f9c9","resolution":{"observed_at":"2026-08-02T08:36:07.911651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.033744Z","title":"Channel polarization: A method for con- structing capacity-achieving codes for symmetric binary- input memoryless channels,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.033744Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:a7f8627911a569aa97d4419e3916a3a851c86d18b4b7e1158ae8d37bb1f02fff","observation_id":"06e1e5ed-0038-45a5-9ec2-202fa348f49c","resolution":{"observed_at":"2026-08-02T08:36:08.033744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.093659Z","title":"Reed–Muller codes achieve capacity on erasure channels,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.093659Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:f400399d33119365637e0d838ce9123241b65ac5894ad45249a04f9dbdd60f8e","observation_id":"70bcf5c1-8342-42f8-9db2-693a8d66de86","resolution":{"observed_at":"2026-08-02T08:36:08.093659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.191113Z","title":"A proof that Reed–Muller codes achieve Shannon capacity on symmetric channels,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.191113Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:895287e4d01b3fb70dd10fbfb5976eb77d2fdd02c5d06779e265a14d6b70757b","observation_id":"b71746a6-cea4-4417-94d1-e61d366b442a","resolution":{"observed_at":"2026-08-02T08:36:08.191113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.304685Z","title":"Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.304685Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:696ee262be799e4012040a8ca83495e32c961489109b7f1222e54d022a2fb25b","observation_id":"409e5eeb-dc47-4bfb-8d86-ec54722f092f","resolution":{"observed_at":"2026-08-02T08:36:08.304685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.364635Z","title":"A family of capacity- achieving Abelian codes for the binary erasure chan- nel,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.364635Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:e9074b48a9e60d5cd0400b8b446d6fcc3709cbe9840ff251a99e654911fe4a8e","observation_id":"5d80dea6-4a84-41e4-a54f-ebae20edb177","resolution":{"observed_at":"2026-08-02T08:36:08.364635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.515886Z","title":"Berman codes: A generalization of Reed–Muller codes that achieve BEC capacity,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.515886Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:78264efb0158aee06b6fc4dcc26931229e2439ac4c2791a4ca22fb0509549aec","observation_id":"dce16964-1128-408f-9683-18768c49c4d7","resolution":{"observed_at":"2026-08-02T08:36:08.515886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05748","last_updated":"2025-02-26T02:02:12Z","snapshot_observed_at":"2026-08-16T12:59:22.560018Z","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05748","snapshot_observed_at":"2026-08-02T08:36:08.639618Z","title":"From bit to block: Decoding on erasure channels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.639618Z"},"links":{"cited_paper":"/paper/2501.05748","citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:6b13762bed663569ace6976854d3451f71bfff626baa91a6342280c279616d16","observation_id":"c6345462-28f9-42e6-a838-b67e79ba2d00","resolution":{"observed_at":"2026-08-02T08:36:08.639618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.733663Z","title":"Tensor Reed– Muller codes: Achieving capacity with quasilinear de- coding time,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.733663Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:2eaf0d2d959890943213f8abc6f3d0ce358e304af3bbb868aaec0385144d5522","observation_id":"afeb365a-366d-4517-8bb8-6c46bb0ecda1","resolution":{"observed_at":"2026-08-02T08:36:08.733663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:08.896293Z","title":"Codes correcteurs d’erreurs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.896293Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:8ba07c081f961b95a6e0205773c9c4128b275e4e00bd148a54ce80b1554cb7e2","observation_id":"4a8d5097-245b-4891-9d03-d24aeaa879fc","resolution":{"observed_at":"2026-08-02T08:36:08.896293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:09.049281Z","title":"On a class of error correcting binary group codes,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:09.049281Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:39781ae36e732da9b21bfa30498e005920c40800dac80d11c73a807aae8720ea","observation_id":"796d12a2-cfcc-415f-8ff4-0433cfbfcfa6","resolution":{"observed_at":"2026-08-02T08:36:09.049281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:09.217551Z","title":"Lin and D","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:09.217551Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:12182276cd6295011f0541d5f703cfddb939152de22f410e5d652820cd566bb9","observation_id":"194a4257-8b56-4dd9-bfe5-b1f22e0516c2","resolution":{"observed_at":"2026-08-02T08:36:09.217551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T08:36:09.271651Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:09.271651Z"},"links":{"citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:6bb5023e15da03c39bf0432f7a94587cc813389218b6a76468692a03bb423c4e","observation_id":"e4b670c2-153d-4b88-9dab-714464c6793f","resolution":{"observed_at":"2026-08-02T08:36:09.271651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.05816."}