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-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

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

source=arxiv_source observed=2026-08-08T13:16:44.683537Z digest=sha256:368f6e84b64805a944049719e12146c329b92091a993ec61ed4e8ffd4a1f642c

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

source=arxiv_source observed=2026-08-08T13:16:44.688849Z digest=sha256:04b3d5fc020120440b9bb315421ef5bd73bd94bdc148c3b2eec4477d40ca3c83

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

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

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

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

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.730256Z digest=sha256:6f2647e305ae020788bed67aa4863ffdcf44e3db263a8d9af777d0a951e1a26f

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.743037Z digest=sha256:3f8762db827c7b2e6a7bd2a99b2756c419cc1405677137e70fb076b11306306f

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.761147Z digest=sha256:17461b5247a32f196c176af5d9aa3706da56521a49e596680fcd89d52b90ae7d

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.782773Z digest=sha256:07f6ee87ce23a38994479ce87ae222aa5ce87b18dcbf899b22fc023810b9c17a

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.828338Z digest=sha256:3503d8a33c74ec1a761756c40fe7cbd6387176bae70750f12ae2b0f966865cf2

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

source=arxiv_source observed=2026-08-08T13:16:44.832611Z digest=sha256:23b21db1133e0711cce81c1cb03ce669bfec83fecc6ae5fd306eb1ca28bf5da7

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

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

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

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

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.875291Z digest=sha256:95f4d3eb809513c5bdcf84359d3eeb796fecd68d3a9ac903b1312f4300ee706a

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

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

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.899879Z digest=sha256:9b6e6e6cf56f9e796c3c5bdd574d4526a792f495c13ee4e10be9509d9c528a70

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.911783Z digest=sha256:07328ec4eab14712237b03212b657db1f27ef3d8064a672d67fdd2120de00707

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

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

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

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

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.928809Z digest=sha256:8cb6ad367ae843b2a4efae7a36e6023552937f20c1950129a064d8cef128331b

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

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

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

source=arxiv_source observed=2026-08-08T13:16:44.937565Z digest=sha256:39d40f06a4be2a5fb781f8d2bfc48d9628cfd2513500fa69cb74d434ef5c7671

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

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

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

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

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

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

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

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

Pith citing papers

No inbound Pith citation observations are available.