{"as_of":"2026-08-14T07:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdba688ff98a02e0eddb66cfe6bdaef0f2699a040d693f469fb23819357367a8","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:16:44.957506Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.07308/citation-record","integrity":"/paper/2502.07308/integrity","json":"/paper/2502.07308/citation-record.json","paper":"/paper/2502.07308"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.673266Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.673266Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:613aef7692980a5b40119f6a5fd4e7e5c89f40738866559899e296756a056a43","observation_id":"2bc61fb8-f99f-4e98-8498-8b0f8a5e0366","resolution":{"observed_at":"2026-08-08T13:16:44.673266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.678853Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.678853Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:8a4e5d224c4bbd2994bb41c2c5f9d7a1cbf9c9591fc17aec4d42836e6cf37578","observation_id":"cf9f5a95-d88d-43db-81bf-d0aac4094cde","resolution":{"observed_at":"2026-08-08T13:16:44.678853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.13424","last_updated":"2024-02-29T00:43:59Z","snapshot_observed_at":"2026-08-13T10:27:36.999826Z","submitted_at":"2023-08-25T15:09:28Z","title":"AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets","version":2},"cited_work":{"arxiv_id":"2308.13424","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.13424","snapshot_observed_at":"2026-08-08T13:16:48.878297Z","title":"AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets","venue":"cs.IT","work_id":"ce4e82f8-e3c8-4381-8120-590677e1e9dd","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.683537Z"},"links":{"cited_paper":"/paper/2308.13424","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:368f6e84b64805a944049719e12146c329b92091a993ec61ed4e8ffd4a1f642c","observation_id":"3c9402e5-317a-442b-bf70-0f836eaff6d8","resolution":{"observed_at":"2026-08-08T13:16:48.883533Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09445","last_updated":"2025-08-28T22:48:10Z","snapshot_observed_at":"2026-08-13T11:59:40.920404Z","submitted_at":"2023-04-19T06:28:54Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","version":6},"cited_work":{"arxiv_id":"2304.09445","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.09445","snapshot_observed_at":"2026-08-08T13:16:48.859820Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","venue":"cs.IT","work_id":"72016d8f-f32c-48c9-83b9-a69a8c13cd08","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.688849Z"},"links":{"cited_paper":"/paper/2304.09445","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:04b3d5fc020120440b9bb315421ef5bd73bd94bdc148c3b2eec4477d40ca3c83","observation_id":"3d7ac8ac-f271-455b-9579-b8e6cc4b82ce","resolution":{"observed_at":"2026-08-08T13:16:48.864342Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.693562Z","title":"List decoding of direct sum codes","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.693562Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:dca99f4216a9a85397b67f22d27d852f18cdc64641d1801ba7857a6ab6cdea95","observation_id":"108fd5ec-3271-404e-9f60-41f8809153b8","resolution":{"observed_at":"2026-08-08T13:16:44.693562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.34490","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.839356Z","title":"Improved field size bounds for higher order mds codes","venue":null,"work_id":"1e70ac59-0311-4311-87c2-991a4c295479","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.698088Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:6067ef59d3771fdc0ca643cb05599cf9de0dd8f9f67f89797a829df8d7740c01","observation_id":"82a452d4-2c49-4bec-add1-e540a1c7eebc","resolution":{"observed_at":"2026-08-08T13:16:48.846493Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09935","last_updated":"2022-12-20T01:01:01Z","snapshot_observed_at":"2026-08-13T13:18:33.373834Z","submitted_at":"2022-12-20T01:01:01Z","title":"Approaching the Quantum Singleton Bound with Approximate Error Correction","version":1},"cited_work":{"arxiv_id":"2212.09935","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.09935","snapshot_observed_at":"2026-08-08T13:16:48.755731Z","title":"Approaching the Quantum Singleton Bound with Approximate Error Correction","venue":"quant-ph","work_id":"c9317c7e-ee22-49f8-ab9d-1869b6063813","year":2022},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.702689Z"},"links":{"cited_paper":"/paper/2212.09935","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:a1bbeeccbadda4954b02b3c5fe1837fa1d886c6e3c430cb0509a00d8a9519ea4","observation_id":"f0c2c8fd-36d3-4666-b8b7-c63bbbf4ce70","resolution":{"observed_at":"2026-08-08T13:16:48.760131Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.05256","last_updated":"2024-08-28T18:13:22Z","snapshot_observed_at":"2026-08-13T15:25:53.265160Z","submitted_at":"2022-06-10T17:54:02Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity","version":4},"cited_work":{"arxiv_id":"2206.05256","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.05256","snapshot_observed_at":"2026-08-08T13:16:48.736938Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity","venue":"cs.IT","work_id":"a024f5bc-df4a-4806-9274-d00977c00bcc","year":2022},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.707473Z"},"links":{"cited_paper":"/paper/2206.05256","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:6843e9bb9c1dd14a7e9bfb019ee8a86e734144c88933069cc43cb91e32b6f3e9","observation_id":"6b8dbf86-7134-44ad-a12a-c67f8610b8fe","resolution":{"observed_at":"2026-08-08T13:16:48.741546Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.33458","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.714376Z","title":"Ideal-Theoretic Explanation of Capacity-Achieving Decoding","venue":null,"work_id":"84ba4355-6343-4acd-9475-589c63754261","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.711966Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:23f622034926659431554bce21c091e96195cc0e189e2b16eb211fca69326f3a","observation_id":"0c87c1f9-c72d-464b-bdfb-1a99a6f9f086","resolution":{"observed_at":"2026-08-08T13:16:48.722271Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.717360Z","title":"Rounding semidefinite programming hierarchies via global correlation","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.717360Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:25edf532e964e91e9c8488d2072cad850dad549e1ea76b6462c367fb31ad5515","observation_id":"adae177b-0bf9-4c96-88f7-f03d9bb27fbc","resolution":{"observed_at":"2026-08-08T13:16:44.717360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5236","last_updated":"2014-05-27T17:52:52Z","snapshot_observed_at":"2026-07-06T03:41:40.557510Z","submitted_at":"2014-04-21T16:24:13Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.5236","snapshot_observed_at":"2026-08-08T13:16:44.721574Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.721574Z"},"links":{"cited_paper":"/paper/1404.5236","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:4a0896e3c642602f6a3c7a41725263caf39179e6bd1550318ba79468d69417e6","observation_id":"234f9045-4f3b-4457-8668-90a1f17ffc10","resolution":{"observed_at":"2026-08-08T13:16:44.721574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15034","last_updated":"2024-01-26T17:53:34Z","snapshot_observed_at":"2026-08-14T01:42:19.916021Z","submitted_at":"2024-01-26T17:53:34Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","version":1},"cited_work":{"arxiv_id":"2401.15034","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.15034","snapshot_observed_at":"2026-08-08T13:16:48.614825Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","venue":"cs.IT","work_id":"74b7be0a-6596-4aca-9505-68c8962ab1bf","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.725998Z"},"links":{"cited_paper":"/paper/2401.15034","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:257e239a03a40614f6ea45612eabfe3816232fffa7d113b1a8b6ec957ee7172a","observation_id":"bbed455f-a836-4a95-9972-68b8be2bfc30","resolution":{"observed_at":"2026-08-08T13:16:48.621320Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0542.78056","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.593428Z","title":"Reconstructing curves in three (and higher) dimensional space from noisy data","venue":null,"work_id":"6c40fa33-22a6-4c05-97b0-0fd2a1edb49c","year":2003},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.730256Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:6f2647e305ae020788bed67aa4863ffdcf44e3db263a8d9af777d0a951e1a26f","observation_id":"f44fb931-4126-4481-a31e-a2a4da309f97","resolution":{"observed_at":"2026-08-08T13:16:48.600485Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-12T22:55:46.086122Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":"2408.15925","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-08T13:16:48.523659Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","venue":"cs.IT","work_id":"2963001e-9c1a-4ef2-a0e4-709375cb2c6e","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.734524Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:12b33f4a3697d3aca11cc4e83cc7a661f7aee760cf014edce5ce8b7c3004f331","observation_id":"2e0760f5-9400-40ca-ab59-39680d75a54a","resolution":{"observed_at":"2026-08-08T13:16:48.529834Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.739123Z","title":"Subspace evasive sets","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.739123Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:96ca1eb519f3f3a87dbaae520770b781ee2739b547bae989f7a3fb80160fea82","observation_id":"041c6093-72e6-4e16-8561-1122cd22b973","resolution":{"observed_at":"2026-08-08T13:16:44.739123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.173253Z","title":"List decoding for noisy channels","venue":null,"work_id":"a6a5cdf1-0d1c-4de9-a4bb-552791846f35","year":1957},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.743037Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:3f8762db827c7b2e6a7bd2a99b2756c419cc1405677137e70fb076b11306306f","observation_id":"f63a9fd5-aa12-4c28-9fe8-a6377bdc908e","resolution":{"observed_at":"2026-08-08T13:16:49.177539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.747111Z","title":"Semialgebraic proofs and efficient algorithm design","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.747111Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:9453c799faa8f25d0270d69354c9cacbd825fbd53217d07ba87698ddad78d4e0","observation_id":"093f858b-c54f-4bf5-a99f-3220fddd96e7","resolution":{"observed_at":"2026-08-08T13:16:44.747111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.414847Z","title":"List-decodability with large radius for Reed-Solomon codes","venue":null,"work_id":"7e91ac04-9988-4dc9-951e-8d72979e0ae1","year":2021},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.751902Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d4d2cc803afac6c890e191a691b58fdb23c04d94c7b2daee9b30c370f21397b1","observation_id":"35caabd1-7ef7-4854-b775-b347a509708b","resolution":{"observed_at":"2026-08-08T13:16:48.419419Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.042573Z","title":"On the list-decodability of random linear codes","venue":null,"work_id":"e534e7d6-b50f-4d9c-a15d-64de5ffc2bd2","year":2011},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.761147Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:17461b5247a32f196c176af5d9aa3706da56521a49e596680fcd89d52b90ae7d","observation_id":"232589d7-249f-4c5d-88a9-c1a74bc72b5c","resolution":{"observed_at":"2026-08-08T13:16:48.046649Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.159525Z","title":"Guruswami and P","venue":null,"work_id":"447f1f95-9a4d-4343-9752-0780d3440402","year":2005},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.765133Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:af1d1b2b689e6fe176aa2c783e043e516271bf1c6c160cd87f12ec4047e3bda2","observation_id":"6a4941e0-47a4-449f-8878-6045a621df49","resolution":{"observed_at":"2026-08-08T13:16:49.163762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.770163Z","title":"Explicit subspace designs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.770163Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:ff6a727bb9d7caca34561ceb3e2d3ea5fbfa1d061b19ee5f10334eae996e1258","observation_id":"66c184c0-f854-405f-91ac-fb046d001885","resolution":{"observed_at":"2026-08-08T13:16:44.770163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.145962Z","title":"Locally testable and locally correctable codes approaching the Gilbert - Varshamov bound","venue":null,"work_id":"4cd867d7-8839-410b-85cc-47e90a333801","year":2017},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.774301Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:717194b615c3cb5f978b496198762f4b539022930e67244abf5b1aa22f177163","observation_id":"15e0ce45-cffe-43e6-8953-a9f0a7b71614","resolution":{"observed_at":"2026-08-08T13:16:49.150674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04453","last_updated":"2023-12-26T15:10:23Z","snapshot_observed_at":"2026-08-10T20:28:18.020131Z","submitted_at":"2020-11-09T14:22:37Z","title":"Improved List-Decodability of Reed--Solomon Codes via Tree Packings","version":2},"cited_work":{"arxiv_id":"2011.04453","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.04453","snapshot_observed_at":"2026-08-08T13:16:47.873563Z","title":"Improved List-Decodability of Reed--Solomon Codes via Tree Packings","venue":"cs.IT","work_id":"8dce8670-af1c-43a2-a630-d397d994428d","year":2020},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.778423Z"},"links":{"cited_paper":"/paper/2011.04453","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d10f1ea932df55c841794d2e495f8478c92627dbb32cd04fbbdba379ef31f46c","observation_id":"2d6e05cc-62b1-47a1-9912-5eebe45e97cd","resolution":{"observed_at":"2026-08-08T13:16:47.878706Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:47.854561Z","title":"Combinatorial Limitations of Average-Radius List-Decoding","venue":null,"work_id":"9cfdc0ff-6975-456b-b522-5393759a6d3a","year":2014},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.782773Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:07f6ee87ce23a38994479ce87ae222aa5ce87b18dcbf899b22fc023810b9c17a","observation_id":"392b401c-5b55-48e6-86ea-6a85a4fb0a75","resolution":{"observed_at":"2026-08-08T13:16:47.859573Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.786808Z","title":"Explicit capacity-achieving list-decodable codes","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.786808Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:21322cf291089e45fa7e8134ce7adf166e4dabfa3d0a73bc229ee98dbf3bc695","observation_id":"fc634611-320e-450c-8910-11a5876cce3a","resolution":{"observed_at":"2026-08-08T13:16:44.786808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:47.672000Z","title":"Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy","venue":null,"work_id":"659ed75d-3f25-4c87-bf4e-1782102f8613","year":2008},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.790714Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e622ed30ae0d24558e01cc5379547ebe22e0a7b6eb3d670edd1c457b3e5b23ba","observation_id":"a39ec42f-51b6-4207-8cf7-287cf55222b9","resolution":{"observed_at":"2026-08-08T13:16:47.678781Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.122775Z","title":"Essential coding theory","venue":null,"work_id":"a46f88fa-c766-4a6b-93fe-b3e0916d471e","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.794877Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:10fb02bb5e6deb3eff4fd95e2a079c7e2294ee1985420301cf8fb985b7f12620","observation_id":"fe701969-4bc5-41f8-be8f-ba8e4e8187e3","resolution":{"observed_at":"2026-08-08T13:16:49.127043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:47.486842Z","title":"Efficient list-decoding with constant alphabet and list sizes","venue":null,"work_id":"b43bb604-e652-46fc-bbce-466e44d01e3f","year":2021},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.799157Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:c58d349938950c02116116ff09747118ecffe5542176e8abe92c482d6dc88a49","observation_id":"75bfd237-791a-4af5-b80b-0ebdfb29dd09","resolution":{"observed_at":"2026-08-08T13:16:47.491120Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.109769Z","title":"Goldreich and M","venue":null,"work_id":"4d8ad37c-2a01-412c-a292-258cbc9321c4","year":1998},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.803136Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e96a8b9807335159642fa4cdd3c698ca1f25b85d9d217b22917203a210d4cb49","observation_id":"43fbd795-74b5-4971-9495-24ffcefeab1b","resolution":{"observed_at":"2026-08-08T13:16:49.113926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:47.306909Z","title":"List-decoding and list-recovery of Reed–Solomon codes beyond the Johnson radius for every rate","venue":null,"work_id":"39e3fe75-cc8a-46b0-bf35-6248b119f42b","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.807849Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:3f3c378563010a0ba661f6253a3a1b974e0591dfd5c3515c822d867fd3ce1d49","observation_id":"318538f2-895b-44ca-866a-128b98a8010e","resolution":{"observed_at":"2026-08-08T13:16:47.313647Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.095546Z","title":"Algorithmic results in list decoding","venue":null,"work_id":"b99d11d5-5061-473d-85a2-c8e2eb9ea5c2","year":2006},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.811734Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:4f9636e76c40e24561b88dbd1509285988f1dfb83aeefcb42099d8b18bc68b57","observation_id":"4588e8d4-6b0e-44f8-97ce-a09ea1283f31","resolution":{"observed_at":"2026-08-08T13:16:49.100215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.191703Z","title":"Artin automorphisms, cyclotomic function fields, and folded list-decodable codes","venue":null,"work_id":"009d8458-888b-4a4c-abac-aef5c5a93350","year":2009},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.816185Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:4601c7993f254092e82c9139fc2d09101654aa115ac8fffdcb0aa32d01b5162a","observation_id":"a60213eb-2a0e-49b1-a74b-1c55e5fb0162","resolution":{"observed_at":"2026-08-08T13:16:48.197150Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.082583Z","title":"Linear-algebraic list decoding of folded Reed-Solomon codes","venue":null,"work_id":"f70ce37f-c2ab-4f10-80dc-73a3ba6812f5","year":2011},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.820438Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:a126531d3abdbd9ba22fae424d2d62c4770ea8ddaa9ac954e3c4806ff62e332d","observation_id":"5a5c609f-394b-4015-8de4-2197254f3817","resolution":{"observed_at":"2026-08-08T13:16:49.086824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.068650Z","title":"Unbalanced expanders and randomness extractors from P arvaresh-- V ardy codes","venue":null,"work_id":"7fd34ec0-b363-46f9-8911-35612eee5fbf","year":2009},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.824403Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e961a3db699cbdd48b0c474afcea99dd5a87eaf76799141dce7be7c1831eb00e","observation_id":"c9801791-e724-4f85-b563-315c8f6cb254","resolution":{"observed_at":"2026-08-08T13:16:49.073413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:47.158460Z","title":"Linear-Algebraic List Decoding for Variants of Reed--Solomon Codes","venue":null,"work_id":"cb7d90ce-6a08-4511-9242-bd68c7a0b2e2","year":2013},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.828338Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:3503d8a33c74ec1a761756c40fe7cbd6387176bae70750f12ae2b0f966865cf2","observation_id":"9b927f26-ee77-4282-9890-513ea34eb403","resolution":{"observed_at":"2026-08-08T13:16:47.162497Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:46.913013Z","title":"List Decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin Subcodes up to the Singleton Bound","venue":null,"work_id":"dd52e4fa-e1bd-4fd5-9051-472ef6854ad7","year":2013},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.832611Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:23b21db1133e0711cce81c1cb03ce669bfec83fecc6ae5fd306eb1ca28bf5da7","observation_id":"f13a3970-a147-4b66-b2cf-2b82d24a088a","resolution":{"observed_at":"2026-08-08T13:16:46.917974Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3506668","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Optimal rate list decoding over bounded alphabets using algebraic-geometric codes","venue":"Journal of the ACM","work_id":"8f45199e-2b93-477a-89db-23cf86a20d41","year":2022},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.836897Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:3b83ccd13c08756c526b3500bc6a631a974b387ed857d082eb20dfb41e07d52b","observation_id":"1dc2ce29-436b-458d-9097-2475b19fe984","resolution":{"observed_at":"2026-08-08T13:16:45.061251Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2018.02.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.043276Z","title":"Linear-time list recovery of high-rate expander codes","venue":null,"work_id":"b07bc602-9006-45d1-927d-c0a913f7ee0f","year":2018},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.845191Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:ec2733f98b8a85319d1ebbed0be26691a85c16c66b8b6fea9a0a313839bbf3c4","observation_id":"82726861-8f5f-43a7-ba21-445fe93fec5e","resolution":{"observed_at":"2026-08-08T13:16:45.047656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.849502Z","title":"Unique decoding of explicit -balanced codes near the G ilbert-- V arshamov bound","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.849502Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:c9b6f9984642d55ecd3b1152c862a95012d7b10252972f98f4d9dcefa9528506","observation_id":"10ecda74-20c8-4783-aa81-060259187caf","resolution":{"observed_at":"2026-08-08T13:16:44.849502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02263","last_updated":"2023-11-03T23:02:32Z","snapshot_observed_at":"2026-08-13T05:33:06.148870Z","submitted_at":"2023-11-03T23:02:32Z","title":"List Decoding of Tanner and Expander Amplified Codes from Distance Certificates","version":1},"cited_work":{"arxiv_id":"2311.02263","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.02263","snapshot_observed_at":"2026-08-08T13:16:46.560206Z","title":"List Decoding of Tanner and Expander Amplified Codes from Distance Certificates","venue":"cs.DS","work_id":"2c7575df-f9b7-447e-9344-a22e8f2b0738","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.853877Z"},"links":{"cited_paper":"/paper/2311.02263","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d89a379bfc512f3d6a44c307f4a660e42010ff7a7b4a2500eaea03fdd303c006","observation_id":"a36f6341-a8ec-4e94-a01f-3d061ef5068c","resolution":{"observed_at":"2026-08-08T13:16:46.565450Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:46.541555Z","title":"High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity","venue":null,"work_id":"b378d14c-c7b1-47ad-b844-d86dccc7c5c7","year":2016},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.858123Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:9c5d6a56e87c1d1b627cebdba808a370de36207a499f117559b9fbc8a0afb087","observation_id":"bae23602-8d6e-400c-aa8e-3aa58b3ca493","resolution":{"observed_at":"2026-08-08T13:16:46.545820Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.862330Z","title":"List-Decoding Multiplicity Codes","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.862330Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:2dbf6a9ff2b0992155344f5d62db83984c9c617b7180984fce0acc625f0fea77","observation_id":"57a56ccb-a9f7-44b2-a5e3-f50ce4952a48","resolution":{"observed_at":"2026-08-08T13:16:44.862330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01498","last_updated":"2018-05-03T18:29:18Z","snapshot_observed_at":"2026-07-06T06:37:18.870380Z","submitted_at":"2018-05-03T18:29:18Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","version":1},"cited_work":{"arxiv_id":"1805.01498","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.01498","snapshot_observed_at":"2026-08-08T13:16:46.384065Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","venue":"cs.IT","work_id":"8f74af21-cc25-4fe6-8bf7-22f8837c12e5","year":2018},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.866661Z"},"links":{"cited_paper":"/paper/1805.01498","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d0ee884926ecf81bf5c51e4ff41eca2102419527900a0f0b6c2e3342b09ceb76","observation_id":"cb23c349-7e15-4a49-9cbe-d2cc937ba94c","resolution":{"observed_at":"2026-08-08T13:16:46.389171Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.871130Z","title":"Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.871130Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:3fc505939cd223f9f67661459a7e07158d988ce50346b38995562380b7e65bb6","observation_id":"0af65405-ecc3-403c-ac6c-47381d5ccdff","resolution":{"observed_at":"2026-08-08T13:16:44.871130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2629416","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.012033Z","title":"High-rate codes with sublinear-time decoding","venue":null,"work_id":"5c319708-82f8-43d9-a4fe-47501af6bd12","year":2014},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.875291Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:95f4d3eb809513c5bdcf84359d3eeb796fecd68d3a9ac903b1312f4300ee706a","observation_id":"f96df0e8-6d8d-4cce-a595-b2e68ce7f2a4","resolution":{"observed_at":"2026-08-08T13:16:45.017317Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.044916Z","title":"Phillips, and Peter Sarnak","venue":null,"work_id":"1968de7a-c62f-4dde-9979-2f9d12f5365a","year":1988},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.879312Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d9d7c2898ffa8660b440491339e2e5a263f6ddffadbc8590e7ba7bde22b4036c","observation_id":"e30abb38-c504-4e20-896f-5185491164da","resolution":{"observed_at":"2026-08-08T13:16:49.050308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:46.365801Z","title":"Mosheiff, N","venue":null,"work_id":"9a5611df-8a6f-4df0-9272-eb88e6909f50","year":2020},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.883394Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:600f0c44159812b72e35f4569461362505eed18639c4ae5d68fba07030d762a9","observation_id":"751ea379-d8bd-42a3-9ada-c19d9bf95c81","resolution":{"observed_at":"2026-08-08T13:16:46.370466Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.887738Z","title":"SOS Is Not Obviously Automatizable, Even Approximately","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.887738Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:eb16f681f4dfbde84791214946c210b6e0f514fb414bae8349f5d2ccac521103","observation_id":"0b27b400-5b2c-4414-8a30-a5c55e1dd110","resolution":{"observed_at":"2026-08-08T13:16:44.887738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.030897Z","title":"Correcting errors beyond the G uruswami- S udan radius in polynomial time","venue":null,"work_id":"154d0e28-43ea-4996-87e9-f713f5ee2a80","year":2005},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.891767Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:bd2b6f428760828b34841af1891a33805fc9f073c03a40646a1cc1022acd2be3","observation_id":"0ea33db4-66a3-4bf3-a93e-19ffba64cf7a","resolution":{"observed_at":"2026-08-08T13:16:49.035222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:46.056459Z","title":null,"venue":null,"work_id":"2e8f92c1-7db5-40e9-a804-bc0851341617","year":2022},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.895815Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:08bdede92695d3350472b5e85fdb0a819289038e15e35d075ae08eb40fca3722","observation_id":"cfba72e1-aeac-499e-9dde-1ac9a0a75f3a","resolution":{"observed_at":"2026-08-08T13:16:46.060603Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:46.749841Z","title":"Richelson and S","venue":null,"work_id":"1cc12113-190b-4915-b58b-c1b820c5fc91","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.899879Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:9b6e6e6cf56f9e796c3c5bdd574d4526a792f495c13ee4e10be9509d9c528a70","observation_id":"cf830e2a-36e1-4bd2-9590-701a1d2a905b","resolution":{"observed_at":"2026-08-08T13:16:46.754856Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.016897Z","title":"Reed and G","venue":null,"work_id":"7cb4e9ba-0c72-4dcb-a346-8fe7a329d2ac","year":1960},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.903612Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:c4b7823317fd19ac534edb8df7d0e84b550ea5a6cbd587b3af8ed04293bd421a","observation_id":"62485ada-4c1e-4743-9182-164ce16ed5ed","resolution":{"observed_at":"2026-08-08T13:16:49.021133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.900244Z","title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings","venue":null,"work_id":"3beb0b68-6a75-4ac0-ad25-817049eaa2c9","year":2014},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.907827Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:8dafb93179df7a1c0bad6b20dc2ec70d90e512b0265e57c8b81876ac82f98edf","observation_id":"023abade-a572-4a37-ae26-8e58c2750e3b","resolution":{"observed_at":"2026-08-08T13:16:45.904773Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:49.003610Z","title":"On the bit complexity of sum-of-squares proofs","venue":null,"work_id":"fbe67771-b0ab-4c35-8fec-ca52668d60d6","year":2017},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.911783Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:07328ec4eab14712237b03212b657db1f27ef3d8064a672d67fdd2120de00707","observation_id":"a9ddfc42-e962-4eb4-8f81-b7923e8076b2","resolution":{"observed_at":"2026-08-08T13:16:49.007998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14652","last_updated":"2024-08-26T21:33:34Z","snapshot_observed_at":"2026-08-12T22:57:03.145883Z","submitted_at":"2024-08-26T21:33:34Z","title":"Continuous Optimization for Decoding Errors","version":1},"cited_work":{"arxiv_id":"2408.14652","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.14652","snapshot_observed_at":"2026-08-08T13:16:45.728563Z","title":"Continuous Optimization for Decoding Errors","venue":"cs.IT","work_id":"95b25363-965c-4c1c-81b4-b59d0570a345","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.915718Z"},"links":{"cited_paper":"/paper/2408.14652","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:a61879399075c2f4a7053802c537c656e8468efe9eaa61f972952ed53ac2da56","observation_id":"d18ab89e-dd74-454b-8268-cbb98c0e7521","resolution":{"observed_at":"2026-08-08T13:16:45.733755Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09031","last_updated":"2024-10-11T17:48:43Z","snapshot_observed_at":"2026-08-12T22:25:13.883577Z","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon Codes","version":1},"cited_work":{"arxiv_id":"2410.09031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09031","snapshot_observed_at":"2026-08-08T13:16:45.710429Z","title":"Improved List Size for Folded Reed-Solomon Codes","venue":"cs.IT","work_id":"24e5618f-e28d-465c-9cbf-cfbe2be78f27","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.920237Z"},"links":{"cited_paper":"/paper/2410.09031","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:f06b56b2ad1626ec0c635c1571f625bffea78713b4535c46d49335bb37ac35e7","observation_id":"756faae6-ca15-402c-8cc7-5ac461d954f5","resolution":{"observed_at":"2026-08-08T13:16:45.714994Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.689993Z","title":"Combinatorial list-decoding of Reed - Solomon codes beyond the Johnson radius","venue":null,"work_id":"2fc8512d-698a-4b23-8288-984eadbe7918","year":2020},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.924489Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:6f22c77cba7d82ebabe7cffdf64771464876cb762b4dc80fe496bb421e51920d","observation_id":"ba5464c3-c27d-4ab3-a4f5-64cdc751d4b4","resolution":{"observed_at":"2026-08-08T13:16:45.696588Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.989630Z","title":"Decoding of Reed - Solomon codes beyond the error-correction bound","venue":null,"work_id":"32fc638c-072a-46d6-b80c-42a089bd9d6f","year":1997},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.928809Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:8cb6ad367ae843b2a4efae7a36e6023552937f20c1950129a064d8cef128331b","observation_id":"c733d710-5529-43de-ac55-5a7692dc2a7d","resolution":{"observed_at":"2026-08-08T13:16:48.994602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.976241Z","title":"List decoding: algorithms and applications","venue":null,"work_id":"fd999f29-8f16-436d-afab-0cbdb52aa507","year":2000},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.933341Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:d2251d40ec77874e4ef2300460dbb7bd69190aa8dd266e0d07a3884852f47bdb","observation_id":"41ffe341-a71b-4547-8670-d40e2f2b0a55","resolution":{"observed_at":"2026-08-08T13:16:48.980622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.520297Z","title":"Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes","venue":null,"work_id":"2fc53c86-a463-4805-b4ec-3a3f9c36239b","year":2024},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.937565Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:39d40f06a4be2a5fb781f8d2bfc48d9628cfd2513500fa69cb74d434ef5c7671","observation_id":"41d0785c-c04f-417f-9822-c97d3b7b4d02","resolution":{"observed_at":"2026-08-08T13:16:45.525376Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:45.281578Z","title":"Some Applications of Coding Theory in Computational Complexity","venue":null,"work_id":"98141b8c-5cae-4921-8810-f440f7a2cc0d","year":2004},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.941380Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:a1535e531016c739eb93d9247443473d1e6eeeb9ab6017431e820873b3199c72","observation_id":"ac65f6d7-2f7c-481a-a754-ba5634886153","resolution":{"observed_at":"2026-08-08T13:16:45.286242Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:44.945352Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.945352Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:f3d338e369b8127a06ce4e9beaad8e224361d42e85ce502497157c6fe7279d4b","observation_id":"22b342fe-0f98-4039-b41b-274cb130e214","resolution":{"observed_at":"2026-08-08T13:16:44.945352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.2261","last_updated":"2013-07-09T23:48:20Z","snapshot_observed_at":"2026-07-06T03:06:03.997370Z","submitted_at":"2013-02-09T19:41:59Z","title":"On the list decodability of random linear codes with large error rates","version":3},"cited_work":{"arxiv_id":"1302.2261","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.2261","snapshot_observed_at":"2026-08-08T13:16:45.091713Z","title":"On the list decodability of random linear codes with large error rates","venue":"cs.IT","work_id":"0c848572-8979-4773-9b52-572311510536","year":2013},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.949130Z"},"links":{"cited_paper":"/paper/1302.2261","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e4873b9b9821607a480d3a586174e139fd0325e25dabdefe5dd9664fd2fca179","observation_id":"b9b18eee-2f71-4f52-b51b-bbc0e6af40f4","resolution":{"observed_at":"2026-08-08T13:16:45.096536Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:16:48.952856Z","title":null,"venue":null,"work_id":"7233b40b-1cc0-4808-bfd7-3aeb43508fe5","year":1958},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.953445Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:bd11195e8d8ee1887c709c0dd5546478c556543ae527df98d294f24b21a5d9e6","observation_id":"4a781224-76c7-4588-96f0-d3fe87e0311a","resolution":{"observed_at":"2026-08-08T13:16:48.957097Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/18.910593","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Z \\'e mor","venue":"IEEE Transactions on Information Theory","work_id":"17cf4d85-bcd2-42b0-877b-1dd339893c05","year":2001},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.957506Z"},"links":{"citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e3387095e905e6c5c72c8f4f0db47e886d909eca320f3bff70ac876eb97869bc","observation_id":"31139f49-8989-4d84-a238-689728a3f327","resolution":{"observed_at":"2026-08-08T13:16:44.993048Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":15,"verified_exact":33,"verified_fuzzy":14},"total_outbound_references":65},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"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."}