Paper Citation Record · LEDGER

Explicit Codes approaching Generalized Singleton Bound using Expanders

As of 18 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 1 inbound Pith citation observation for arXiv:2502.07308.

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

pith.paper-citation-record.v1
2502.07308 v1

Coverage vector

measured 65 of 65 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T13:16:44.957506Z

measured 66 of 66 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-16T05:45:52.543659Z

Reference resolution

65 of 65 outbound references displayed

verified exact33
verified fuzzy14
unresolved15
parse uncertain0
malformed identifier0
metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2bc61fb8-f99f-4e98-8498-8b0f8a5e0366 · outbound

This paper cites an unresolved cited work.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.673266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf9f5a95-d88d-43db-81bf-d0aac4094cde · outbound

This paper cites an unresolved cited work.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.678853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c9402e5-317a-442b-bf70-0f836eaff6d8 · outbound

This paper cites AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets.

Explicit Codes approaching Generalized Singleton Bound using Expanders AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.883533Z

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.

Observation 3d7ac8ac-f271-455b-9579-b8e6cc4b82ce · outbound

This paper cites Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets.

Explicit Codes approaching Generalized Singleton Bound using Expanders Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.864342Z

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.

Observation 108fd5ec-3271-404e-9f60-41f8809153b8 · outbound

This paper cites List decoding of direct sum codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders List decoding of direct sum codes

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.693562Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82a452d4-2c49-4bec-add1-e540a1c7eebc · outbound

This paper cites Improved field size bounds for higher order mds codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Improved field size bounds for higher order mds codes

Reference 6

Resolution: metadata mismatch; raw_fallback, observed 2026-08-08T13:16:48.846493Z

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.

Observation f0c2c8fd-36d3-4666-b8b7-c63bbbf4ce70 · outbound

This paper cites Approaching the Quantum Singleton Bound with Approximate Error Correction.

Explicit Codes approaching Generalized Singleton Bound using Expanders Approaching the Quantum Singleton Bound with Approximate Error Correction

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.760131Z

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.

Observation 6b8dbf86-7134-44ad-a12a-c67f8610b8fe · outbound

This paper cites Generic Reed-Solomon Codes Achieve List-decoding Capacity.

Explicit Codes approaching Generalized Singleton Bound using Expanders Generic Reed-Solomon Codes Achieve List-decoding Capacity

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.741546Z

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.

Observation 0c87c1f9-c72d-464b-bdfb-1a99a6f9f086 · outbound

This paper cites Ideal-Theoretic Explanation of Capacity-Achieving Decoding.

Explicit Codes approaching Generalized Singleton Bound using Expanders Ideal-Theoretic Explanation of Capacity-Achieving Decoding

Reference 9

Resolution: metadata mismatch; raw_fallback, observed 2026-08-08T13:16:48.722271Z

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.

Observation adae177b-0bf9-4c96-88f7-f03d9bb27fbc · outbound

This paper cites Rounding semidefinite programming hierarchies via global correlation.

Explicit Codes approaching Generalized Singleton Bound using Expanders Rounding semidefinite programming hierarchies via global correlation

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.717360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 234f9045-4f3b-4457-8668-90a1f17ffc10 · outbound

This paper cites Sum-of-squares proofs and the quest toward optimal algorithms.

Explicit Codes approaching Generalized Singleton Bound using Expanders Sum-of-squares proofs and the quest toward optimal algorithms

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.721574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbed455f-a836-4a95-9972-68b8be2bfc30 · outbound

This paper cites Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.

Explicit Codes approaching Generalized Singleton Bound using Expanders Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.621320Z

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.

Observation f44fb931-4126-4481-a31e-a2a4da309f97 · outbound

This paper cites Reconstructing curves in three (and higher) dimensional space from noisy data.

Explicit Codes approaching Generalized Singleton Bound using Expanders Reconstructing curves in three (and higher) dimensional space from noisy data

Reference 13

Resolution: metadata mismatch; raw_fallback, observed 2026-08-08T13:16:48.600485Z

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.

Observation 2e0760f5-9400-40ca-ab59-39680d75a54a · outbound

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

Explicit Codes approaching Generalized Singleton Bound using Expanders Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

Reference 14

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:48.529834Z

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.

Observation 041c6093-72e6-4e16-8561-1122cd22b973 · outbound

This paper cites Subspace evasive sets.

Explicit Codes approaching Generalized Singleton Bound using Expanders Subspace evasive sets

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.739123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f63a9fd5-aa12-4c28-9fe8-a6377bdc908e · outbound

This paper cites List decoding for noisy channels.

Explicit Codes approaching Generalized Singleton Bound using Expanders List decoding for noisy channels

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.177539Z

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.

Observation 093f858b-c54f-4bf5-a99f-3220fddd96e7 · outbound

This paper cites Semialgebraic proofs and efficient algorithm design.

Explicit Codes approaching Generalized Singleton Bound using Expanders Semialgebraic proofs and efficient algorithm design

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.747111Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35caabd1-7ef7-4854-b775-b347a509708b · outbound

This paper cites List-decodability with large radius for Reed-Solomon codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders List-decodability with large radius for Reed-Solomon codes

Reference 18

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:48.419419Z

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.

Observation 232589d7-249f-4c5d-88a9-c1a74bc72b5c · outbound

This paper cites On the list-decodability of random linear codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders On the list-decodability of random linear codes

Reference 20

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:48.046649Z

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.

Observation 6a4941e0-47a4-449f-8878-6045a621df49 · outbound

This paper cites Guruswami and P.

Explicit Codes approaching Generalized Singleton Bound using Expanders Guruswami and P

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.163762Z

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.

Observation 66c184c0-f854-405f-91ac-fb046d001885 · outbound

This paper cites Explicit subspace designs.

Explicit Codes approaching Generalized Singleton Bound using Expanders Explicit subspace designs

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.770163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15e0ce45-cffe-43e6-8953-a9f0a7b71614 · outbound

This paper cites Locally testable and locally correctable codes approaching the Gilbert - Varshamov bound.

Explicit Codes approaching Generalized Singleton Bound using Expanders Locally testable and locally correctable codes approaching the Gilbert - Varshamov bound

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.150674Z

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.

Observation 2d6e05cc-62b1-47a1-9912-5eebe45e97cd · outbound

This paper cites Improved List-Decodability of Reed--Solomon Codes via Tree Packings.

Explicit Codes approaching Generalized Singleton Bound using Expanders Improved List-Decodability of Reed--Solomon Codes via Tree Packings

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:47.878706Z

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.

Observation 392b401c-5b55-48e6-86ea-6a85a4fb0a75 · outbound

This paper cites Combinatorial Limitations of Average-Radius List-Decoding.

Explicit Codes approaching Generalized Singleton Bound using Expanders Combinatorial Limitations of Average-Radius List-Decoding

Reference 25

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:47.859573Z

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.

Observation fc634611-320e-450c-8910-11a5876cce3a · outbound

This paper cites Explicit capacity-achieving list-decodable codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Explicit capacity-achieving list-decodable codes

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.786808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a39ec42f-51b6-4207-8cf7-287cf55222b9 · outbound

This paper cites Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy.

Explicit Codes approaching Generalized Singleton Bound using Expanders Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy

Reference 27

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:47.678781Z

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.

Observation fe701969-4bc5-41f8-be8f-ba8e4e8187e3 · outbound

This paper cites Essential coding theory.

Explicit Codes approaching Generalized Singleton Bound using Expanders Essential coding theory

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.127043Z

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.

Observation 75bfd237-791a-4af5-b80b-0ebdfb29dd09 · outbound

This paper cites Efficient list-decoding with constant alphabet and list sizes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Efficient list-decoding with constant alphabet and list sizes

Reference 29

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:47.491120Z

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.

Observation 43fbd795-74b5-4971-9495-24ffcefeab1b · outbound

This paper cites Goldreich and M.

Explicit Codes approaching Generalized Singleton Bound using Expanders Goldreich and M

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.113926Z

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.

Observation 318538f2-895b-44ca-866a-128b98a8010e · outbound

This paper cites List-decoding and list-recovery of Reed–Solomon codes beyond the Johnson radius for every rate.

Explicit Codes approaching Generalized Singleton Bound using Expanders List-decoding and list-recovery of Reed–Solomon codes beyond the Johnson radius for every rate

Reference 31

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:47.313647Z

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.

Observation 4588e8d4-6b0e-44f8-97ce-a09ea1283f31 · outbound

This paper cites Algorithmic results in list decoding.

Explicit Codes approaching Generalized Singleton Bound using Expanders Algorithmic results in list decoding

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.100215Z

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.

Observation a60213eb-2a0e-49b1-a74b-1c55e5fb0162 · outbound

This paper cites Artin automorphisms, cyclotomic function fields, and folded list-decodable codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Artin automorphisms, cyclotomic function fields, and folded list-decodable codes

Reference 33

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:48.197150Z

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.

Observation 5a5c609f-394b-4015-8de4-2197254f3817 · outbound

This paper cites Linear-algebraic list decoding of folded Reed-Solomon codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Linear-algebraic list decoding of folded Reed-Solomon codes

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.086824Z

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.

Observation c9801791-e724-4f85-b563-315c8f6cb254 · outbound

This paper cites Unbalanced expanders and randomness extractors from P arvaresh-- V ardy codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unbalanced expanders and randomness extractors from P arvaresh-- V ardy codes

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.073413Z

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.

Observation 9b927f26-ee77-4282-9890-513ea34eb403 · outbound

This paper cites Linear-Algebraic List Decoding for Variants of Reed--Solomon Codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Linear-Algebraic List Decoding for Variants of Reed--Solomon Codes

Reference 36

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:47.162497Z

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.

Observation f13a3970-a147-4b66-b2cf-2b82d24a088a · outbound

This paper cites List Decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin Subcodes up to the Singleton Bound.

Explicit Codes approaching Generalized Singleton Bound using Expanders List Decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin Subcodes up to the Singleton Bound

Reference 37

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:46.917974Z

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.

Observation 1dc2ce29-436b-458d-9097-2475b19fe984 · outbound

This paper cites Optimal rate list decoding over bounded alphabets using algebraic-geometric codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Optimal rate list decoding over bounded alphabets using algebraic-geometric codes

Reference 38

Resolution: verified exact; doi, observed 2026-08-08T13:16:45.061251Z

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.

Observation 82726861-8f5f-43a7-ba21-445fe93fec5e · outbound

This paper cites Linear-time list recovery of high-rate expander codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Linear-time list recovery of high-rate expander codes

Reference 40

Resolution: verified exact; doi, observed 2026-08-08T13:16:45.047656Z

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.

Observation 10ecda74-20c8-4783-aa81-060259187caf · outbound

This paper cites Unique decoding of explicit -balanced codes near the G ilbert-- V arshamov bound.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unique decoding of explicit -balanced codes near the G ilbert-- V arshamov bound

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.849502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a36f6341-a8ec-4e94-a01f-3d061ef5068c · outbound

This paper cites List Decoding of Tanner and Expander Amplified Codes from Distance Certificates.

Explicit Codes approaching Generalized Singleton Bound using Expanders List Decoding of Tanner and Expander Amplified Codes from Distance Certificates

Reference 42

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:46.565450Z

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.

Observation bae23602-8d6e-400c-aa8e-3aa58b3ca493 · outbound

This paper cites High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity.

Explicit Codes approaching Generalized Singleton Bound using Expanders High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Reference 43

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:46.545820Z

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.

Observation 57a56ccb-a9f7-44b2-a5e3-f50ce4952a48 · outbound

This paper cites List-Decoding Multiplicity Codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders List-Decoding Multiplicity Codes

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.862330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb23c349-7e15-4a49-9cbe-d2cc937ba94c · outbound

This paper cites Improved decoding of Folded Reed-Solomon and Multiplicity Codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Improved decoding of Folded Reed-Solomon and Multiplicity Codes

Reference 45

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:46.389171Z

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.

Observation 0af65405-ecc3-403c-ac6c-47381d5ccdff · outbound

This paper cites Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.871130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f96df0e8-6d8d-4cce-a595-b2e68ce7f2a4 · outbound

This paper cites High-rate codes with sublinear-time decoding.

Explicit Codes approaching Generalized Singleton Bound using Expanders High-rate codes with sublinear-time decoding

Reference 47

Resolution: verified exact; doi, observed 2026-08-08T13:16:45.017317Z

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.

Observation e30abb38-c504-4e20-896f-5185491164da · outbound

This paper cites Phillips, and Peter Sarnak.

Explicit Codes approaching Generalized Singleton Bound using Expanders Phillips, and Peter Sarnak

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.050308Z

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.

Observation 751ea379-d8bd-42a3-9ada-c19d9bf95c81 · outbound

This paper cites Mosheiff, N.

Explicit Codes approaching Generalized Singleton Bound using Expanders Mosheiff, N

Reference 49

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:46.370466Z

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.

Observation 0b27b400-5b2c-4414-8a30-a5c55e1dd110 · outbound

This paper cites SOS Is Not Obviously Automatizable, Even Approximately.

Explicit Codes approaching Generalized Singleton Bound using Expanders SOS Is Not Obviously Automatizable, Even Approximately

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.887738Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ea33db4-66a3-4bf3-a93e-19ffba64cf7a · outbound

This paper cites Correcting errors beyond the G uruswami- S udan radius in polynomial time.

Explicit Codes approaching Generalized Singleton Bound using Expanders Correcting errors beyond the G uruswami- S udan radius in polynomial time

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.035222Z

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.

Observation cfba72e1-aeac-499e-9dde-1ac9a0a75f3a · outbound

This paper cites an unresolved cited work.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unresolved cited work

Reference 52

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:46.060603Z

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.

Observation cf830e2a-36e1-4bd2-9590-701a1d2a905b · outbound

This paper cites Richelson and S.

Explicit Codes approaching Generalized Singleton Bound using Expanders Richelson and S

Reference 53

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:46.754856Z

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.

Observation 62485ada-4c1e-4743-9182-164ce16ed5ed · outbound

This paper cites Reed and G.

Explicit Codes approaching Generalized Singleton Bound using Expanders Reed and G

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.021133Z

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.

Observation 023abade-a572-4a37-ae26-8e58c2750e3b · outbound

This paper cites Every list-decodable code for high noise has abundant near-optimal rate puncturings.

Explicit Codes approaching Generalized Singleton Bound using Expanders Every list-decodable code for high noise has abundant near-optimal rate puncturings

Reference 55

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:45.904773Z

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.

Observation a9ddfc42-e962-4eb4-8f81-b7923e8076b2 · outbound

This paper cites On the bit complexity of sum-of-squares proofs.

Explicit Codes approaching Generalized Singleton Bound using Expanders On the bit complexity of sum-of-squares proofs

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:49.007998Z

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.

Observation d18ab89e-dd74-454b-8268-cbb98c0e7521 · outbound

This paper cites Continuous Optimization for Decoding Errors.

Explicit Codes approaching Generalized Singleton Bound using Expanders Continuous Optimization for Decoding Errors

Reference 57

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:45.733755Z

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.

Observation 756faae6-ca15-402c-8cc7-5ac461d954f5 · outbound

This paper cites Improved List Size for Folded Reed-Solomon Codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Improved List Size for Folded Reed-Solomon Codes

Reference 58

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:45.714994Z

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.

Observation ba5464c3-c27d-4ab3-a4f5-64cdc751d4b4 · outbound

This paper cites Combinatorial list-decoding of Reed - Solomon codes beyond the Johnson radius.

Explicit Codes approaching Generalized Singleton Bound using Expanders Combinatorial list-decoding of Reed - Solomon codes beyond the Johnson radius

Reference 59

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:45.696588Z

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.

Observation c733d710-5529-43de-ac55-5a7692dc2a7d · outbound

This paper cites Decoding of Reed - Solomon codes beyond the error-correction bound.

Explicit Codes approaching Generalized Singleton Bound using Expanders Decoding of Reed - Solomon codes beyond the error-correction bound

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:48.994602Z

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.

Observation 41ffe341-a71b-4547-8670-d40e2f2b0a55 · outbound

This paper cites List decoding: algorithms and applications.

Explicit Codes approaching Generalized Singleton Bound using Expanders List decoding: algorithms and applications

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T13:16:48.980622Z

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.

Observation 41d0785c-c04f-417f-9822-c97d3b7b4d02 · outbound

This paper cites Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes.

Explicit Codes approaching Generalized Singleton Bound using Expanders Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes

Reference 62

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:45.525376Z

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.

Observation ac65f6d7-2f7c-481a-a754-ba5634886153 · outbound

This paper cites Some Applications of Coding Theory in Computational Complexity.

Explicit Codes approaching Generalized Singleton Bound using Expanders Some Applications of Coding Theory in Computational Complexity

Reference 63

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T13:16:45.286242Z

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.

Observation 22b342fe-0f98-4039-b41b-274cb130e214 · outbound

This paper cites an unresolved cited work.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unresolved cited work

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-08T13:16:44.945352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9b18eee-2f71-4f52-b51b-bbc0e6af40f4 · outbound

This paper cites On the list decodability of random linear codes with large error rates.

Explicit Codes approaching Generalized Singleton Bound using Expanders On the list decodability of random linear codes with large error rates

Reference 65

Resolution: verified exact; local_arxiv, observed 2026-08-08T13:16:45.096536Z

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.

Observation 4a781224-76c7-4588-96f0-d3fe87e0311a · outbound

This paper cites an unresolved cited work.

Explicit Codes approaching Generalized Singleton Bound using Expanders Unresolved cited work

Reference 66

Resolution: unresolved; raw_fallback, observed 2026-08-08T13:16:48.957097Z

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.

Observation 31139f49-8989-4d84-a238-689728a3f327 · outbound

This paper cites Z \'e mor.

Explicit Codes approaching Generalized Singleton Bound using Expanders Z \'e mor

Reference 67

Resolution: verified exact; doi, observed 2026-08-08T13:16:44.993048Z

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.

Pith citing papers

Observation 438c3171-009e-4b0b-91aa-d8793ec46f07 · 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 Explicit Codes approaching Generalized Singleton Bound using Expanders

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:45:52.548575Z

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.