{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:A7B35P25CNKK4MUFAXCZLDSQWQ","short_pith_number":"pith:A7B35P25","schema_version":"1.0","canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","source":{"kind":"arxiv","id":"cs/0511072","version":2},"attestation_state":"computed","paper":{"title":"Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Atri Rudra, Venkatesan Guruswami","submitted_at":"2005-11-18T22:31:44Z","abstract_excerpt":"We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every $0 < R < 1$ and $\\eps> 0$, we present an explicit construction of error-correcting codes of rate $R$ that can be list decoded in polynomial time up to a fraction $(1-R-\\eps)$ of {\\em worst-case} errors. At least theoretically, this meets one of the central challenges in algorithmic coding theory.\n  Our codes are simple to describe: they are {\\em folded Reed-Solomon codes}, which are in fact {\\em exactly} Reed-Solomon (RS) cod"},"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":"cs/0511072","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-18T22:31:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e57bc4d57f6723785aa947394bafea3b5fbc42dd2234d0acf8face3ded80d48","abstract_canon_sha256":"b6a81c5b32ee9f4599b3d7185008a8ee7bdf58e876ae2e8060eab3c0a84105e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:44.059731Z","signature_b64":"wM67iZDkuQPmX9Rixsfsbt3QiAptpGDlRRucFqBxuFGnXHdIaWDnUE7EvIqu4BUJCsihLv0gToX+7hTfamaGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","last_reissued_at":"2026-07-04T15:04:44.059371Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:44.059371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Atri Rudra, Venkatesan Guruswami","submitted_at":"2005-11-18T22:31:44Z","abstract_excerpt":"We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every $0 < R < 1$ and $\\eps> 0$, we present an explicit construction of error-correcting codes of rate $R$ that can be list decoded in polynomial time up to a fraction $(1-R-\\eps)$ of {\\em worst-case} errors. At least theoretically, this meets one of the central challenges in algorithmic coding theory.\n  Our codes are simple to describe: they are {\\em folded Reed-Solomon codes}, which are in fact {\\em exactly} Reed-Solomon (RS) cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511072","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/cs/0511072/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":"cs/0511072","created_at":"2026-07-04T15:04:44.059436+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0511072v2","created_at":"2026-07-04T15:04:44.059436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511072","created_at":"2026-07-04T15:04:44.059436+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7B35P25CNKK","created_at":"2026-07-04T15:04:44.059436+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7B35P25CNKK4MUF","created_at":"2026-07-04T15:04:44.059436+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7B35P25","created_at":"2026-07-04T15:04:44.059436+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16596","citing_title":"Bivariate Linear Operator Codes","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ","json":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ.json","graph_json":"https://pith.science/api/pith-number/A7B35P25CNKK4MUFAXCZLDSQWQ/graph.json","events_json":"https://pith.science/api/pith-number/A7B35P25CNKK4MUFAXCZLDSQWQ/events.json","paper":"https://pith.science/paper/A7B35P25"},"agent_actions":{"view_html":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ","download_json":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ.json","view_paper":"https://pith.science/paper/A7B35P25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0511072&json=true","fetch_graph":"https://pith.science/api/pith-number/A7B35P25CNKK4MUFAXCZLDSQWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/A7B35P25CNKK4MUFAXCZLDSQWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/action/storage_attestation","attest_author":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/action/author_attestation","sign_citation":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/action/citation_signature","submit_replication":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/action/replication_record"}},"created_at":"2026-07-04T15:04:44.059436+00:00","updated_at":"2026-07-04T15:04:44.059436+00:00"}