Paper Citation Record · LEDGER

From Bit to Block: Capacity Achievement via Code Concatenation

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.05816 v2

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T08:36:09.271651Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

13 of 13 outbound references displayed

verified exact0
verified fuzzy0
unresolved13
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation de0573ab-c7e1-4bfd-b2a5-4cb081b5f9c9 · outbound

This paper cites A mathematical theory of communi- cation,.

From Bit to Block: Capacity Achievement via Code Concatenation A mathematical theory of communi- cation,

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:07.911651Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06e1e5ed-0038-45a5-9ec2-202fa348f49c · outbound

This paper cites Channel polarization: A method for con- structing capacity-achieving codes for symmetric binary- input memoryless channels,.

From Bit to Block: Capacity Achievement via Code Concatenation Channel polarization: A method for con- structing capacity-achieving codes for symmetric binary- input memoryless channels,

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.033744Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70bcf5c1-8342-42f8-9db2-693a8d66de86 · outbound

This paper cites Reed–Muller codes achieve capacity on erasure channels,.

From Bit to Block: Capacity Achievement via Code Concatenation Reed–Muller codes achieve capacity on erasure channels,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.093659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b71746a6-cea4-4417-94d1-e61d366b442a · outbound

This paper cites A proof that Reed–Muller codes achieve Shannon capacity on symmetric channels,.

From Bit to Block: Capacity Achievement via Code Concatenation A proof that Reed–Muller codes achieve Shannon capacity on symmetric channels,

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.191113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 409e5eeb-dc47-4bfb-8d86-ec54722f092f · outbound

This paper cites Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,.

From Bit to Block: Capacity Achievement via Code Concatenation Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.304685Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d80dea6-4a84-41e4-a54f-ebae20edb177 · outbound

This paper cites A family of capacity- achieving Abelian codes for the binary erasure chan- nel,.

From Bit to Block: Capacity Achievement via Code Concatenation A family of capacity- achieving Abelian codes for the binary erasure chan- nel,

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.364635Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dce16964-1128-408f-9683-18768c49c4d7 · outbound

This paper cites Berman codes: A generalization of Reed–Muller codes that achieve BEC capacity,.

From Bit to Block: Capacity Achievement via Code Concatenation Berman codes: A generalization of Reed–Muller codes that achieve BEC capacity,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.515886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6345462-28f9-42e6-a838-b67e79ba2d00 · outbound

This paper cites From Bit to Block: Decoding on Erasure Channels.

From Bit to Block: Capacity Achievement via Code Concatenation From Bit to Block: Decoding on Erasure Channels

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.639618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afeb365a-366d-4517-8bb8-6c46bb0ecda1 · outbound

This paper cites Tensor Reed– Muller codes: Achieving capacity with quasilinear de- coding time,.

From Bit to Block: Capacity Achievement via Code Concatenation Tensor Reed– Muller codes: Achieving capacity with quasilinear de- coding time,

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.733663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a8d5097-245b-4891-9d03-d24aeaa879fc · outbound

This paper cites Codes correcteurs d’erreurs,.

From Bit to Block: Capacity Achievement via Code Concatenation Codes correcteurs d’erreurs,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:08.896293Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 796d12a2-cfcc-415f-8ff4-0433cfbfcfa6 · outbound

This paper cites On a class of error correcting binary group codes,.

From Bit to Block: Capacity Achievement via Code Concatenation On a class of error correcting binary group codes,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:09.049281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 194a4257-8b56-4dd9-bfe5-b1f22e0516c2 · outbound

This paper cites Lin and D.

From Bit to Block: Capacity Achievement via Code Concatenation Lin and D

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:09.217551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4b670c2-153d-4b88-9dab-714464c6793f · outbound

This paper cites an unresolved cited work.

From Bit to Block: Capacity Achievement via Code Concatenation Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T08:36:09.271651Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.