Paper Citation Record · LEDGER

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes

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

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

pith.paper-citation-record.v1
2502.05858 v2

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T17:54:42.181686Z

measured 10 of 10 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 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

10 of 10 outbound references displayed

verified exact4
verified fuzzy4
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dc7acaed-6348-419f-9757-995e0d0a91aa · outbound

This paper cites Almost K-Wise vs. k-Wi se Independent Permuta- tions, and Uniformity for General Group Actions.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes Almost K-Wise vs. k-Wi se Independent Permuta- tions, and Uniformity for General Group Actions

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:54:42.498399Z

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.

Observation 93339f28-b46e-4ceb-9bd5-7230c664c436 · outbound

This paper cites Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes.

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-14T06:32:32.682623+00:00.

Observation bac82d7d-c843-4c57-a673-b0ffbc68de32 · outbound

This paper cites Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes.

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.

Observation 5da12eac-ee59-4172-9247-8b16d17c705a · outbound

This paper cites Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Z entrum f¨ ur Informatik, 2022, 55:1–55:17.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Z entrum f¨ ur Informatik, 2022, 55:1–55:17

Reference 229

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:54:42.487564Z

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.

Observation 6b711581-107d-4b28-9a57-e528841e006c · outbound

This paper cites ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk

Reference 234

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:54:42.466839Z

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.

Observation bbd135c8-9618-42cc-86cd-b16de3388963 · outbound

This paper cites doi: 10.1007/978-3-031-58737-5_11.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes doi: 10.1007/978-3-031-58737-5_11

Reference 315

Resolution: verified exact; doi, observed 2026-08-08T17:54:42.205309Z

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.

Observation f92542ae-67eb-40b3-9498-e33d9c9e6b2a · outbound

This paper cites On the List-Decodability of Random Linear Codes.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes On the List-Decodability of Random Linear Codes

Reference 1957

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T17:54:42.477296Z

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.

Observation 67930a5c-c08f-4b87-8e9e-b9088da619ee · outbound

This paper cites Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-08T17:54:42.151739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32a73985-d623-4745-be06-47333123db6e · outbound

This paper cites Near-Optimal List-Recovery of Linear Code Families.

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-14T06:32:32.682623+00:00.

Observation 5a82355c-0a79-4b32-9de2-7e0708456084 · outbound

This paper cites Local List Recovery of High- Rate Tensor Codes and Applications.

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes Local List Recovery of High- Rate Tensor Codes and Applications

Reference 3268

Resolution: verified exact; arxiv_id, observed 2026-08-08T17:54:42.446389Z

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.

Pith citing papers

No inbound Pith citation observations are available.