Pith. sign in

Paper Citation Record · LEDGER

Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes

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

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

pith.paper-citation-record.v1
2312.17097 v1

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-14T06:32:32.682623+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-12T13:11:50.871720Z

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

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 809b7342-4d78-4c0b-aec3-ae1637660a0d · inbound

Bivariate Linear Operator Codes cites this paper.

Bivariate Linear Operator Codes Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-12T13:11:50.871720Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T13:11:50.871720Z digest=sha256:d80b2fed985481fd7ff3a66c5b218a952adf5ecb7e49c9ee648465ecf6d54506

Observation bac82d7d-c843-4c57-a673-b0ffbc68de32 · 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 Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes

Reference 10

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

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-08T17:54:42.181686Z digest=sha256:dd41b95d096ebead23b228a84678907166c6e26f9de12360549d25f7728ca121