{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RIOLNTTPKIXJA5DVFOLNHXEYKU","short_pith_number":"pith:RIOLNTTP","canonical_record":{"source":{"id":"1411.6667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T21:54:47Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b000afdffde2784c4a12540b6f4d3dab757f2ed002a8efe2d19ef4701f9b300f","abstract_canon_sha256":"41362135df786d2a328229b053362d73b2a73d134c9eedf47b6654b8855fc5ca"},"schema_version":"1.0"},"canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","source":{"kind":"arxiv","id":"1411.6667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6667","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6667v1","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6667","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"RIOLNTTPKIXJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIOLNTTPKIXJA5DV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIOLNTTP","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RIOLNTTPKIXJA5DVFOLNHXEYKU","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T21:54:47Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b000afdffde2784c4a12540b6f4d3dab757f2ed002a8efe2d19ef4701f9b300f","abstract_canon_sha256":"41362135df786d2a328229b053362d73b2a73d134c9eedf47b6654b8855fc5ca"},"schema_version":"1.0"},"canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:52.721324Z","signature_b64":"IIaNDqB2RfgZHu3inDpLyqac07AbHVO4WEpGWtiThWtnVa0Es6bJdhC/bsyHFer664eBloqt/a3OvPiko6vyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","last_reissued_at":"2026-05-18T02:32:52.720900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:52.720900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6667","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-18T02:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Slkv/RkrvrFWNh2SgHtKcknQ6Z5/eXMR37ErpbSxUCCnmaAPbcEgzZI/02vS9UYg9qsxZx1HnpAlzUk4oYaiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:02:40.401371Z"},"content_sha256":"ba157e335e8b5ed480299ddcf5005de8b4709464c5024d6b4c7a972e8e253b46","schema_version":"1.0","event_id":"sha256:ba157e335e8b5ed480299ddcf5005de8b4709464c5024d6b4c7a972e8e253b46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RIOLNTTPKIXJA5DVFOLNHXEYKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deletion codes in the high-noise and high-rate regimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2014-11-24T21:54:47Z","abstract_excerpt":"The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper, we study the harder model of worst-case deletions, with a focus on constructing efficiently decodable codes for the two extreme regimes of high-noise and high-rate. Specifically, we construct polynomial-time decodable codes with the following trade-offs (for any eps > 0):\n  (1) Codes that can correct a fraction 1-eps of deletions with rate poly(eps) over an alphabet of size poly(1/eps);\n  (2) Binary codes of rate 1-O~"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6667","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-18T02:32:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNfjGK5BJn28Q7/jofWtG5slgIvQuqGegeQSceosplH/oo+0oEa0fT2OZLt8Gp6CJGXYCGilDIsoUL4l7nu9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:02:40.402156Z"},"content_sha256":"4f387d657038f93b6b6713e4238ee9ccaf52f421878422521c8dcab6ee110a4d","schema_version":"1.0","event_id":"sha256:4f387d657038f93b6b6713e4238ee9ccaf52f421878422521c8dcab6ee110a4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/bundle.json","state_url":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/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-05-20T21:02:40Z","links":{"resolver":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU","bundle":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/bundle.json","state":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RIOLNTTPKIXJA5DVFOLNHXEYKU","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":"41362135df786d2a328229b053362d73b2a73d134c9eedf47b6654b8855fc5ca","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T21:54:47Z","title_canon_sha256":"b000afdffde2784c4a12540b6f4d3dab757f2ed002a8efe2d19ef4701f9b300f"},"schema_version":"1.0","source":{"id":"1411.6667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6667","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6667v1","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6667","created_at":"2026-05-18T02:32:52Z"},{"alias_kind":"pith_short_12","alias_value":"RIOLNTTPKIXJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIOLNTTPKIXJA5DV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIOLNTTP","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:4f387d657038f93b6b6713e4238ee9ccaf52f421878422521c8dcab6ee110a4d","target":"graph","created_at":"2026-05-18T02:32:52Z","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":"The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper, we study the harder model of worst-case deletions, with a focus on constructing efficiently decodable codes for the two extreme regimes of high-noise and high-rate. Specifically, we construct polynomial-time decodable codes with the following trade-offs (for any eps > 0):\n  (1) Codes that can correct a fraction 1-eps of deletions with rate poly(eps) over an alphabet of size poly(1/eps);\n  (2) Binary codes of rate 1-O~","authors_text":"Carol Wang, Venkatesan Guruswami","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T21:54:47Z","title":"Deletion codes in the high-noise and high-rate regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6667","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:ba157e335e8b5ed480299ddcf5005de8b4709464c5024d6b4c7a972e8e253b46","target":"record","created_at":"2026-05-18T02:32:52Z","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":"41362135df786d2a328229b053362d73b2a73d134c9eedf47b6654b8855fc5ca","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-24T21:54:47Z","title_canon_sha256":"b000afdffde2784c4a12540b6f4d3dab757f2ed002a8efe2d19ef4701f9b300f"},"schema_version":"1.0","source":{"id":"1411.6667","kind":"arxiv","version":1}},"canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","first_computed_at":"2026-05-18T02:32:52.720900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:52.720900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IIaNDqB2RfgZHu3inDpLyqac07AbHVO4WEpGWtiThWtnVa0Es6bJdhC/bsyHFer664eBloqt/a3OvPiko6vyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:52.721324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba157e335e8b5ed480299ddcf5005de8b4709464c5024d6b4c7a972e8e253b46","sha256:4f387d657038f93b6b6713e4238ee9ccaf52f421878422521c8dcab6ee110a4d"],"state_sha256":"fcd0c666ca1fdeb55fcbe0f816ea0042ee92d26e133f984ef0a039020b8faf73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xkNF3TLrzo3qH6Uw/lQVm4XndlToGryyZ1YywtqJlIkBCv57/BIZgmB+p6DagD+HxlHDacS+5Aible4QqDCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:02:40.405285Z","bundle_sha256":"b29eca30eb2106aba86fd4805b5406328ffd5594048b135b0c4f4322628f2477"}}