{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LWVHVHMUSEBX4VUCYCFFEGGWK3","short_pith_number":"pith:LWVHVHMU","schema_version":"1.0","canonical_sha256":"5daa7a9d9491037e5682c08a5218d656ff31ae8001a42777cdf0978f0828a870","source":{"kind":"arxiv","id":"2402.11533","version":2},"attestation_state":"computed","paper":{"title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Yuan, Jonathan Mosheiff, Kuo Shang, Nicolas Resch","submitted_at":"2024-02-18T10:11:46Z","abstract_excerpt":"We wish to generate list-decodable codes over small alphabets using as little randomness as possible. Specifically, we hope to generate codes achieving what we term the Elias bound, which means that they are $(\\rho,L)$-list-decodable with rate $R \\geq 1-h(\\rho)-O(1/L)$. A long line of work shows that uniformly random linear codes (RLCs) achieve the Elias bound: hence, we know $O(n^2)$ random bits suffice. Prior works demonstrate that just $O(Ln)$ random bits suffice, via puncturing of low-bias codes. These recent constructions are combinatorial.\n  We provide two new constructions, which are al"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.11533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-18T10:11:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ddd4111fdccbdd7fd1ed9db886df573ac899238e3cb5088fde8e1b5be2c8677c","abstract_canon_sha256":"108ea728072529647a050b44ab198ee705caea9e72be30306d9a045374af1417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:22.663067Z","signature_b64":"SGWFeRIEjEFRHFzsEEKoUxBX7h/rfhL+GQ34bdC0ceg01qj0qpbXxyxDJa9rsiFh9FyV3HuuqWjrczo78df2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5daa7a9d9491037e5682c08a5218d656ff31ae8001a42777cdf0978f0828a870","last_reissued_at":"2026-07-05T08:19:22.662538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:22.662538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Yuan, Jonathan Mosheiff, Kuo Shang, Nicolas Resch","submitted_at":"2024-02-18T10:11:46Z","abstract_excerpt":"We wish to generate list-decodable codes over small alphabets using as little randomness as possible. Specifically, we hope to generate codes achieving what we term the Elias bound, which means that they are $(\\rho,L)$-list-decodable with rate $R \\geq 1-h(\\rho)-O(1/L)$. A long line of work shows that uniformly random linear codes (RLCs) achieve the Elias bound: hence, we know $O(n^2)$ random bits suffice. Prior works demonstrate that just $O(Ln)$ random bits suffice, via puncturing of low-bias codes. These recent constructions are combinatorial.\n  We provide two new constructions, which are al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11533","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.11533/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.11533","created_at":"2026-07-05T08:19:22.662606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11533v2","created_at":"2026-07-05T08:19:22.662606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11533","created_at":"2026-07-05T08:19:22.662606+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWVHVHMUSEBX","created_at":"2026-07-05T08:19:22.662606+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWVHVHMUSEBX4VUC","created_at":"2026-07-05T08:19:22.662606+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWVHVHMU","created_at":"2026-07-05T08:19:22.662606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05858","citing_title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3","json":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3.json","graph_json":"https://pith.science/api/pith-number/LWVHVHMUSEBX4VUCYCFFEGGWK3/graph.json","events_json":"https://pith.science/api/pith-number/LWVHVHMUSEBX4VUCYCFFEGGWK3/events.json","paper":"https://pith.science/paper/LWVHVHMU"},"agent_actions":{"view_html":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3","download_json":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3.json","view_paper":"https://pith.science/paper/LWVHVHMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11533&json=true","fetch_graph":"https://pith.science/api/pith-number/LWVHVHMUSEBX4VUCYCFFEGGWK3/graph.json","fetch_events":"https://pith.science/api/pith-number/LWVHVHMUSEBX4VUCYCFFEGGWK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3/action/storage_attestation","attest_author":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3/action/author_attestation","sign_citation":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3/action/citation_signature","submit_replication":"https://pith.science/pith/LWVHVHMUSEBX4VUCYCFFEGGWK3/action/replication_record"}},"created_at":"2026-07-05T08:19:22.662606+00:00","updated_at":"2026-07-05T08:19:22.662606+00:00"}