Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T11:34:52.368829Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-13T18:58:08.775225Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation b957840b-f3e4-4f52-9872-7ada166d630b · inbound
Capacity on BMS Channels via Code Symmetry and Nesting cites this paper.
Capacity on BMS Channels via Code Symmetry and Nesting Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
Reference 34
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:34:52.368829Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b554aa3e-2ba4-4b27-af74-38b109cea1fe · inbound
Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance cites this paper.
Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-05-13T18:58:08.777086Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.