{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:A7B35P25CNKK4MUFAXCZLDSQWQ","short_pith_number":"pith:A7B35P25","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"},"canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","source":{"kind":"arxiv","id":"cs/0511072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511072","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511072v2","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511072","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"A7B35P25CNKK","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_16","alias_value":"A7B35P25CNKK4MUF","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_8","alias_value":"A7B35P25","created_at":"2026-07-04T15:04:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:A7B35P25CNKK4MUFAXCZLDSQWQ","target":"record","payload":{"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"},"canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","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"},"source_kind":"arxiv","source_id":"cs/0511072","source_version":2,"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-07-04T15:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt3o9a7D+eQgd5iO+pzNeBMJS6+zkGBr0fJj27fvGsNnMH+OilU9dYf6Q/omFoBf1b7zK2FfEZo47grStY50Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:37:10.255654Z"},"content_sha256":"8d9cc028030408c95ccfbc8e4eba5c9cffd93d04fb4d4cac0824c3f9a76ad242","schema_version":"1.0","event_id":"sha256:8d9cc028030408c95ccfbc8e4eba5c9cffd93d04fb4d4cac0824c3f9a76ad242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:A7B35P25CNKK4MUFAXCZLDSQWQ","target":"graph","payload":{"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"},"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-07-04T15:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yl21EqUpYXIXnkzHIMj6z+/E9pr6E2egt4Hxa1a5ql1UYsU0gM2K2Zgt1aBwzt1+SI0aSQyyzu0BGVx1QbAfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:37:10.256152Z"},"content_sha256":"9d80814cbca04aad5d60a66d5a3ab85951419d71899be2aa9da6bd605211ba37","schema_version":"1.0","event_id":"sha256:9d80814cbca04aad5d60a66d5a3ab85951419d71899be2aa9da6bd605211ba37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/bundle.json","state_url":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/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-08-14T08:37:10Z","links":{"resolver":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ","bundle":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/bundle.json","state":"https://pith.science/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7B35P25CNKK4MUFAXCZLDSQWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:A7B35P25CNKK4MUFAXCZLDSQWQ","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":"b6a81c5b32ee9f4599b3d7185008a8ee7bdf58e876ae2e8060eab3c0a84105e2","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-18T22:31:44Z","title_canon_sha256":"3e57bc4d57f6723785aa947394bafea3b5fbc42dd2234d0acf8face3ded80d48"},"schema_version":"1.0","source":{"id":"cs/0511072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511072","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511072v2","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511072","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"A7B35P25CNKK","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_16","alias_value":"A7B35P25CNKK4MUF","created_at":"2026-07-04T15:04:44Z"},{"alias_kind":"pith_short_8","alias_value":"A7B35P25","created_at":"2026-07-04T15:04:44Z"}],"graph_snapshots":[{"event_id":"sha256:9d80814cbca04aad5d60a66d5a3ab85951419d71899be2aa9da6bd605211ba37","target":"graph","created_at":"2026-07-04T15:04:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0511072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Atri Rudra, Venkatesan Guruswami","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-11-18T22:31:44Z","title":"Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511072","kind":"arxiv","version":2},"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:8d9cc028030408c95ccfbc8e4eba5c9cffd93d04fb4d4cac0824c3f9a76ad242","target":"record","created_at":"2026-07-04T15:04:44Z","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":"b6a81c5b32ee9f4599b3d7185008a8ee7bdf58e876ae2e8060eab3c0a84105e2","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-11-18T22:31:44Z","title_canon_sha256":"3e57bc4d57f6723785aa947394bafea3b5fbc42dd2234d0acf8face3ded80d48"},"schema_version":"1.0","source":{"id":"cs/0511072","kind":"arxiv","version":2}},"canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07c3bebf5d1354ae328505c5958e50b40b38a2e36738efce9d4e48136e1dbb2a","first_computed_at":"2026-07-04T15:04:44.059371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:04:44.059371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wM67iZDkuQPmX9Rixsfsbt3QiAptpGDlRRucFqBxuFGnXHdIaWDnUE7EvIqu4BUJCsihLv0gToX+7hTfamaGBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:04:44.059731Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0511072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d9cc028030408c95ccfbc8e4eba5c9cffd93d04fb4d4cac0824c3f9a76ad242","sha256:9d80814cbca04aad5d60a66d5a3ab85951419d71899be2aa9da6bd605211ba37"],"state_sha256":"e915c8fa83f3578901b69e4ddb9fbef7b85a532c5cc5347ef2d7a2e3c943f3e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0sDn9TiMiccYNTQJAFDneZGqTmhA6uDyZ5SdQAxoZWMPn5Sfn3D82/VkLZu2wrhbOYLOZXMkDZf30MTujuTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:37:10.261503Z","bundle_sha256":"c61d6eb9d6579a0ae4d433ea7cee468f461cd5ac90a1dded259187eea472d61a"}}