Pith. sign in

Paper Citation Record · LEDGER

Explicit Codes approaching Generalized Singleton Bound using Expanders

As of 14 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations 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 65 of 65 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

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.

source=arxiv_source observed=2026-08-08T13:16:44.673266Z digest=sha256:613aef7692980a5b40119f6a5fd4e7e5c89f40738866559899e296756a056a43

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.

source=arxiv_source observed=2026-08-08T13:16:44.678853Z digest=sha256:8a4e5d224c4bbd2994bb41c2c5f9d7a1cbf9c9591fc17aec4d42836e6cf37578

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.683537Z digest=sha256:06ec65eb71bc13eb325e09483b483ec002a59729e247733b84ab3ee272f2d288

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.688849Z digest=sha256:639dcf6a3543925619bfa0aa95bb4f0f67ad6c13e9f761e324ed280560d6e3a3

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.

source=arxiv_source observed=2026-08-08T13:16:44.693562Z digest=sha256:dca99f4216a9a85397b67f22d27d852f18cdc64641d1801ba7857a6ab6cdea95

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.698088Z digest=sha256:ea2abe5daebbefb31a1ebc97b000b658e7b8aa4c54ba91eefcbb4bbd9612ebb1

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.702689Z digest=sha256:707e642c034a8e9d8a975244b8b8f862fb497f03b0dac79905fdc305db4aa2ad

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.707473Z digest=sha256:d1546435a1274687e6dd48cc36c42655cbfa7a6071a2d579feaad5b1d11ea82a

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.711966Z digest=sha256:c0aba4a8bfff3c358d5d3e69491c80d3239c231f94491b469130fffeb4d86ca8

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.

source=arxiv_source observed=2026-08-08T13:16:44.717360Z digest=sha256:25edf532e964e91e9c8488d2072cad850dad549e1ea76b6462c367fb31ad5515

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.

source=arxiv_source observed=2026-08-08T13:16:44.721574Z digest=sha256:4a0896e3c642602f6a3c7a41725263caf39179e6bd1550318ba79468d69417e6

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.725998Z digest=sha256:d51c19bc3b70746a7198b32f3987e193ae7e44197140a3502129e17ca119c05b

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.730256Z digest=sha256:47a8f038709faf13cb1e418f02180bf0603b35670f81310ffff0beeab3403f4d

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.734524Z digest=sha256:c578ccec7f72a46934f42b2be2e9b7ba9cef48a52230b19b6a802f420755ea5b

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.

source=arxiv_source observed=2026-08-08T13:16:44.739123Z digest=sha256:96ca1eb519f3f3a87dbaae520770b781ee2739b547bae989f7a3fb80160fea82

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.743037Z digest=sha256:622ff41b1dff28cf9e10fb731a94bcd7ef5034b7cef30494322e73ee999f9a13

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.

source=arxiv_source observed=2026-08-08T13:16:44.747111Z digest=sha256:9453c799faa8f25d0270d69354c9cacbd825fbd53217d07ba87698ddad78d4e0

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.751902Z digest=sha256:a5187f708e57dc304b024e662dd73b4bd6d5227e9a4fc39ed3a6c4030eec3724

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.761147Z digest=sha256:2eb74fe26b996f4e67998532cab77fe965a4bf43675275413cf8919ffb823081

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.765133Z digest=sha256:d2fb8f94dcd665b41dc4299be8c7512fc8261bd2aba1e8fb7e707cb709104e87

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.

source=arxiv_source observed=2026-08-08T13:16:44.770163Z digest=sha256:ff6a727bb9d7caca34561ceb3e2d3ea5fbfa1d061b19ee5f10334eae996e1258

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.774301Z digest=sha256:d5cf3f4c1af83894e5918cb76749f44b47161fe494e28ed84796a082d5663bbf

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.778423Z digest=sha256:436c64a6bc69e2e2b904b643c22395243de3a284c4791ef8b06ff51c7413a4c4

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.782773Z digest=sha256:03d3cf0fff330ded2c08cb437acabc07a0a2b78f019054d74ca44d09934a4540

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.

source=arxiv_source observed=2026-08-08T13:16:44.786808Z digest=sha256:21322cf291089e45fa7e8134ce7adf166e4dabfa3d0a73bc229ee98dbf3bc695

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.790714Z digest=sha256:98e9f52f4f6968d3350e1d137317accba55c837db2ab2378c9570d59c3bb38fc

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.794877Z digest=sha256:d6004057e696a2964ed6bf05e9fcd541a6eeae0e1007edfeec8f96c04cec5a6a

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.799157Z digest=sha256:094da2a8731f61bc00a39284961024f6660449c700298730ce82c62c48436686

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.803136Z digest=sha256:7f45830d4565714cb19d3af645bbe8adfa6b097b008b187f5009cb9138999ce5

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.807849Z digest=sha256:e312d7d43ae80b74f33d6eeb6639087f1d3777d27939505e8b625beed7dbed98

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.811734Z digest=sha256:d21b2c7b9188c819f991d3386e428d446a52a4649b3b46fec9e944fe1e56c160

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.816185Z digest=sha256:a4865bdbacb89a2c602b925be9c4e9a310c03120b082700bfc344b6c7e64df10

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.820438Z digest=sha256:a011c9b961abbfddc39ad552c3169a86f6f676a03b048a894de640974ecfe426

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.824403Z digest=sha256:b189fe9158be5eee694be738c6b9b1ac6f8253dc0db59824d61a1323600f0d96

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.828338Z digest=sha256:5e07781c1ded6e4066a039be1899b064769e68e2e422c27e764f07ec739d0a37

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.832611Z digest=sha256:3a6e792a4a86680620676d59e6dd785a558e9690054de9725ca93ddfe278e58d

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.836897Z digest=sha256:c1d8d5c8c54a15856ef93dd6c05d31412d9ffb826624b521e7e01b1d766b9317

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.845191Z digest=sha256:1c2accb5bfee3ff04abd6899cc1e40fe7eacb46db976317bf55239374e7d8975

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.

source=arxiv_source observed=2026-08-08T13:16:44.849502Z digest=sha256:c9b6f9984642d55ecd3b1152c862a95012d7b10252972f98f4d9dcefa9528506

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.853877Z digest=sha256:8c27faeeddc61b17e54f38d44ce9332b5b9a1f1e68cf20f4cca6acdef936b4e3

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.858123Z digest=sha256:ad0366a77f06c3736c542d5947bd25aa0041c53d1c3a7794deb27c8f51ad099b

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.

source=arxiv_source observed=2026-08-08T13:16:44.862330Z digest=sha256:2dbf6a9ff2b0992155344f5d62db83984c9c617b7180984fce0acc625f0fea77

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.866661Z digest=sha256:51135312c2b47ff1dbf644c09644e45249dcf88293688a35d7577d9d7efef90f

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.

source=arxiv_source observed=2026-08-08T13:16:44.871130Z digest=sha256:3fc505939cd223f9f67661459a7e07158d988ce50346b38995562380b7e65bb6

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.875291Z digest=sha256:737fdeed14a48a5e29384d9f00d9256c91efc6fc3f1652da04160de814d8ecbf

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.879312Z digest=sha256:b18af0b24cd5bf2734c8afe8108a2f856b0b11d40f44ea60da4b27a18358e3ea

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.883394Z digest=sha256:f1ea4eb6c866937ad2ab185804cbf44646ea553f225115f05582e37b65c2b596

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.

source=arxiv_source observed=2026-08-08T13:16:44.887738Z digest=sha256:eb16f681f4dfbde84791214946c210b6e0f514fb414bae8349f5d2ccac521103

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.891767Z digest=sha256:091d156185ce36e70064f123abf9997c5143794cde1031eab3003644546a7164

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.895815Z digest=sha256:facfac14a588f1abefb2cfebae482c087f398f24c3f6d33e525f254b5d7108a9

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.899879Z digest=sha256:8c534f54c66d50ebf56e346dcb24db69ecbdfa5bb2ca8e92b80ff14e04d6371e

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.903612Z digest=sha256:116c3b100f7f879e77ae887787bdc06f3958566d843a0b46f7d1686a6fb044b9

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.907827Z digest=sha256:f807674ef6d5e6767b1521b471e7aae43c70bd3cdaab42c12fe1d8bc49008d4f

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.911783Z digest=sha256:455bc6f4d2b06e8a998584e7a9656d85843fd376adc2836effc5ab289e4cef61

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.915718Z digest=sha256:5fef8ebbc691d3f2f2a69312d1033db9de9337c86070888405cd8f89ebbdf38f

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.920237Z digest=sha256:acbf2f980776fc171e109eff2c5a1ed1ac0ca5a034923d8ac418389259fb1283

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.924489Z digest=sha256:bd27a00b66c0b8520d7cdef029714ca010197f564ac23ed8fab92e1281dae6d0

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.928809Z digest=sha256:710123ccaf8f3b312b893afc8e8aa2eebec59a66c58a038c3695247faa3a8aee

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.933341Z digest=sha256:af5b377b1ac4e618aaef445a91b98d6d9ff0cf738cd0d0f9452ba30bb91920b3

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.937565Z digest=sha256:740df08f8522bcfe129554024466ca5ca0015fdad5bd4bf588c706891c5e9b47

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.941380Z digest=sha256:fae2898825233eebee9eb3d05b75b36b1a31536c769deb577f86383788a1321c

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.

source=arxiv_source observed=2026-08-08T13:16:44.945352Z digest=sha256:f3d338e369b8127a06ce4e9beaad8e224361d42e85ce502497157c6fe7279d4b

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.949130Z digest=sha256:dfe844b4a31cd39f03e3a37e48163c6cf3800905dae36d5043d16a17eb0e0a72

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.953445Z digest=sha256:cfda65a00fee2e5bb09092ca709c54fd7cda2f0af29e9059d52f5002e1c3e17c

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-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T13:16:44.957506Z digest=sha256:626943650b50215cb39b65144a9522e37445ec7a2843b617868a3900a820e920

Pith citing papers

No inbound Pith citation observations are available.