Pith. sign in

Paper Citation Record · LEDGER

Near-Optimal List-Recovery of Linear Code Families

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

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

pith.paper-citation-record.v1
2502.13877 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:45:51.779323Z

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.248728Z

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 32a73985-d623-4745-be06-47333123db6e · 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 Near-Optimal List-Recovery of Linear Code Families

Reference 2025

Resolution
verified exact
local_arxiv, observed 2026-08-08T17:54:42.252837Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-08T17:54:42.168427Z digest=sha256:545f42dce64a6be0d02c42882ffa076405dff2deaac7751fdcef5d09f78151d3

Observation 11823244-9645-457b-845d-b7c9c21d38d0 · inbound

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time cites this paper.

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time Near-Optimal List-Recovery of Linear Code Families

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-16T05:45:51.779323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T05:45:51.779323Z digest=sha256:b55ff1cbb635ea5bd46526600d7ae4f8e02abc5d55fd07ffcf6c62dc661629ad

Observation 6de8bfba-123e-4333-86a6-32b0d4923005 · inbound

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

List-Recovery of Random Linear Codes over Small Fields Near-Optimal List-Recovery of Linear Code Families

Reference 32

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T23:07:01.157645Z digest=sha256:968e3d2aff8dda083bdc64040a2eaddb4f511fa77b8f1bd11bef0873ebf88a5a