Pith. sign in

Paper Citation Record · LEDGER

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes

As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.11533.

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

pith.paper-citation-record.v1
2402.11533 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:07:01.161468Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-08T17:54:42.233218Z

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 93339f28-b46e-4ceb-9bd5-7230c664c436 · inbound

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes cites this paper.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes

Reference 9

Resolution
metadata mismatch
local_arxiv, observed 2026-08-08T17:54:42.237222Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-08T17:54:42.174754Z digest=sha256:49d657f7428f7bd952a9b73d22263d988a3569ca2e7aa66376a22592bd414a31

Observation 3c3c92fa-575a-4aee-b20a-1be400784f46 · inbound

List-Recovery of Random Linear Codes over Small Fields cites this paper.

List-Recovery of Random Linear Codes over Small Fields Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-15T23:07:01.161468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T23:07:01.161468Z digest=sha256:6d971f4691562c194db2627e74787141b9efd06eaf9a1b568522fd08b4fca217