{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WHIJSLDFTQ5BG6DFXQIKGGI2OO","short_pith_number":"pith:WHIJSLDF","schema_version":"1.0","canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","source":{"kind":"arxiv","id":"1310.1891","version":1},"attestation_state":"computed","paper":{"title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Atri Rudra, Mary Wootters","submitted_at":"2013-10-07T19:18:51Z","abstract_excerpt":"We show that any q-ary code with sufficiently good distance can be randomly punctured to obtain, with high probability, a code that is list decodable up to radius $1 - 1/q - \\epsilon$ with near-optimal rate and list sizes. Our results imply that \"most\" Reed-Solomon codes are list decodable beyond the Johnson bound, settling the long-standing open question of whether any Reed Solomon codes meet this criterion.\n  More precisely, we show that a Reed-Solomon code with random evaluation points is, with high probability, list decodable up to radius $1 - \\epsilon$ with list sizes $O(1/\\epsilon)$ and "},"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":"1310.1891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T19:18:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5104086f5967405dc61bfde7328b498dedd1122f7238606fb0ab87abe242c0e5","abstract_canon_sha256":"34fa07d37ee084e62ca1fdd8cc16b0e806fe311c27d4d0b14fd52ea03428a785"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.256062Z","signature_b64":"uETzxVJEgcrvV+oY4558EWiNa4ZyhKXNBOLn4QWSMHQGA5jS+KeF9ovM2JiLFP6f2bf/m2b5p+D9u27KIEvJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","last_reissued_at":"2026-05-18T03:11:10.255167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.255167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Atri Rudra, Mary Wootters","submitted_at":"2013-10-07T19:18:51Z","abstract_excerpt":"We show that any q-ary code with sufficiently good distance can be randomly punctured to obtain, with high probability, a code that is list decodable up to radius $1 - 1/q - \\epsilon$ with near-optimal rate and list sizes. Our results imply that \"most\" Reed-Solomon codes are list decodable beyond the Johnson bound, settling the long-standing open question of whether any Reed Solomon codes meet this criterion.\n  More precisely, we show that a Reed-Solomon code with random evaluation points is, with high probability, list decodable up to radius $1 - \\epsilon$ with list sizes $O(1/\\epsilon)$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1891","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1310.1891","created_at":"2026-05-18T03:11:10.255324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1891v1","created_at":"2026-05-18T03:11:10.255324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1891","created_at":"2026-05-18T03:11:10.255324+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHIJSLDFTQ5B","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHIJSLDFTQ5BG6DF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHIJSLDF","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO","json":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO.json","graph_json":"https://pith.science/api/pith-number/WHIJSLDFTQ5BG6DFXQIKGGI2OO/graph.json","events_json":"https://pith.science/api/pith-number/WHIJSLDFTQ5BG6DFXQIKGGI2OO/events.json","paper":"https://pith.science/paper/WHIJSLDF"},"agent_actions":{"view_html":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO","download_json":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO.json","view_paper":"https://pith.science/paper/WHIJSLDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1891&json=true","fetch_graph":"https://pith.science/api/pith-number/WHIJSLDFTQ5BG6DFXQIKGGI2OO/graph.json","fetch_events":"https://pith.science/api/pith-number/WHIJSLDFTQ5BG6DFXQIKGGI2OO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/action/storage_attestation","attest_author":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/action/author_attestation","sign_citation":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/action/citation_signature","submit_replication":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/action/replication_record"}},"created_at":"2026-05-18T03:11:10.255324+00:00","updated_at":"2026-05-18T03:11:10.255324+00:00"}