{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WHIJSLDFTQ5BG6DFXQIKGGI2OO","short_pith_number":"pith:WHIJSLDF","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"},"canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","source":{"kind":"arxiv","id":"1310.1891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1891","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1891v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1891","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"WHIJSLDFTQ5B","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WHIJSLDFTQ5BG6DF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WHIJSLDF","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WHIJSLDFTQ5BG6DFXQIKGGI2OO","target":"record","payload":{"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"},"canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","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"},"source_kind":"arxiv","source_id":"1310.1891","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjZsd5E7PscJxIhDcJbwcK19qy2KuUdZFvqtuSFCH32keIB0ynK6Z8XM20+Ujq0LZbyYG4rbw7xh9Y0iMRTfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:13.577551Z"},"content_sha256":"3cce634269d87ff3609fcb2d241c3821a9db010d2ab7531f8fe3b336a485fbeb","schema_version":"1.0","event_id":"sha256:3cce634269d87ff3609fcb2d241c3821a9db010d2ab7531f8fe3b336a485fbeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WHIJSLDFTQ5BG6DFXQIKGGI2OO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+Qpdf/zCr87bC/DT/FGbtiQuneH15VYcK07/TDA/X982MLYEYvrIUep0mfrAdxwFS5SkqfHDuNxt/lQyZGdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:13.578375Z"},"content_sha256":"ccf06a96a2cf503aed2dd3d4b7ffe60c063e1cc039d45155aace56760690ca70","schema_version":"1.0","event_id":"sha256:ccf06a96a2cf503aed2dd3d4b7ffe60c063e1cc039d45155aace56760690ca70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/bundle.json","state_url":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T09:47:13Z","links":{"resolver":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO","bundle":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/bundle.json","state":"https://pith.science/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHIJSLDFTQ5BG6DFXQIKGGI2OO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WHIJSLDFTQ5BG6DFXQIKGGI2OO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"34fa07d37ee084e62ca1fdd8cc16b0e806fe311c27d4d0b14fd52ea03428a785","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T19:18:51Z","title_canon_sha256":"5104086f5967405dc61bfde7328b498dedd1122f7238606fb0ab87abe242c0e5"},"schema_version":"1.0","source":{"id":"1310.1891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1891","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1891v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1891","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"WHIJSLDFTQ5B","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WHIJSLDFTQ5BG6DF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WHIJSLDF","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:ccf06a96a2cf503aed2dd3d4b7ffe60c063e1cc039d45155aace56760690ca70","target":"graph","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Atri Rudra, Mary Wootters","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T19:18:51Z","title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1891","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3cce634269d87ff3609fcb2d241c3821a9db010d2ab7531f8fe3b336a485fbeb","target":"record","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"34fa07d37ee084e62ca1fdd8cc16b0e806fe311c27d4d0b14fd52ea03428a785","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T19:18:51Z","title_canon_sha256":"5104086f5967405dc61bfde7328b498dedd1122f7238606fb0ab87abe242c0e5"},"schema_version":"1.0","source":{"id":"1310.1891","kind":"arxiv","version":1}},"canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1d0992c659c3a137865bc10a3191a7393e7feb0a2ad5cc5b269a358d1517d49","first_computed_at":"2026-05-18T03:11:10.255167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.255167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uETzxVJEgcrvV+oY4558EWiNa4ZyhKXNBOLn4QWSMHQGA5jS+KeF9ovM2JiLFP6f2bf/m2b5p+D9u27KIEvJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.256062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cce634269d87ff3609fcb2d241c3821a9db010d2ab7531f8fe3b336a485fbeb","sha256:ccf06a96a2cf503aed2dd3d4b7ffe60c063e1cc039d45155aace56760690ca70"],"state_sha256":"f2367db55c90610f1daef93f916dfca61e0b213d6bd6d75e5f9fc0726045e3fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqZH2ZulLlX7UfEyAbav+TyMctgLDmbDHPsKu3obwBfh32soIWmPrgo9K32KjPCRL67tDFKBHl1NTBn3CHKJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:47:13.581356Z","bundle_sha256":"ebe82e244b2db9b9baead107d8b9bf9a88a13f0e56bb373f7a43bd4347406df4"}}