{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RIOLNTTPKIXJA5DVFOLNHXEYKU","short_pith_number":"pith:RIOLNTTP","schema_version":"1.0","canonical_sha256":"8a1cb6ce6f522e9074752b96d3dc985515abf8585620afd483991aa7d18480a8","source":{"kind":"arxiv","id":"1411.6667","version":1},"attestation_state":"computed","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~"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6667","created_at":"2026-05-18T02:32:52.720960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6667v1","created_at":"2026-05-18T02:32:52.720960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6667","created_at":"2026-05-18T02:32:52.720960+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIOLNTTPKIXJ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIOLNTTPKIXJA5DV","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIOLNTTP","created_at":"2026-05-18T12:28:46.137349+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/RIOLNTTPKIXJA5DVFOLNHXEYKU","json":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU.json","graph_json":"https://pith.science/api/pith-number/RIOLNTTPKIXJA5DVFOLNHXEYKU/graph.json","events_json":"https://pith.science/api/pith-number/RIOLNTTPKIXJA5DVFOLNHXEYKU/events.json","paper":"https://pith.science/paper/RIOLNTTP"},"agent_actions":{"view_html":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU","download_json":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU.json","view_paper":"https://pith.science/paper/RIOLNTTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6667&json=true","fetch_graph":"https://pith.science/api/pith-number/RIOLNTTPKIXJA5DVFOLNHXEYKU/graph.json","fetch_events":"https://pith.science/api/pith-number/RIOLNTTPKIXJA5DVFOLNHXEYKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/action/storage_attestation","attest_author":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/action/author_attestation","sign_citation":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/action/citation_signature","submit_replication":"https://pith.science/pith/RIOLNTTPKIXJA5DVFOLNHXEYKU/action/replication_record"}},"created_at":"2026-05-18T02:32:52.720960+00:00","updated_at":"2026-05-18T02:32:52.720960+00:00"}