{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:THGQEMKQL2TGU52726XKT2Z6VE","short_pith_number":"pith:THGQEMKQ","schema_version":"1.0","canonical_sha256":"99cd0231505ea66a775fd7aea9eb3ea901e8c55d21db159dbd8cb88a3b11f5bb","source":{"kind":"arxiv","id":"1602.06820","version":2},"attestation_state":"computed","paper":{"title":"Codes Correcting a Burst of Deletions or Insertions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Clayton Schoeny, Eitan Yaakobi, Ryan Gabrys","submitted_at":"2016-02-22T15:38:42Z","abstract_excerpt":"This paper studies codes that correct bursts of deletions. Namely, a code will be called a $b$-burst-deletion-correcting code if it can correct a deletion of any $b$ consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically $\\log(n)+b-1$, the redundancy of the best code construction by Cheng et al. is $b(\\log (n/b+1))$. In this paper we close on this gap and provide codes with redundancy at most $\\log(n) + (b-1)\\log(\\log(n)) +b -\\log(b)$.\n  We also derive a non-asymptotic upper bound on the size of $b$-burst-deletion-correcting codes "},"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":"1602.06820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T15:38:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e82e1866554c86c4e9fc130f301b5f4c42deef6237a7045a8ff3803e9295172","abstract_canon_sha256":"bf8c062e9ec101ef03f836aa76f5b6f8ec49b6dfd0700c14024bd524d392d599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.538129Z","signature_b64":"jfrOAo4AGFLlfm6LsHE0HboqxYZI6EsSSPF1ImuP6G9L0wfjC3mP1bkh3B9e0an5nfhh80+6nbE3C7VU7HsgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99cd0231505ea66a775fd7aea9eb3ea901e8c55d21db159dbd8cb88a3b11f5bb","last_reissued_at":"2026-05-18T01:14:58.537738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.537738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes Correcting a Burst of Deletions or Insertions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Clayton Schoeny, Eitan Yaakobi, Ryan Gabrys","submitted_at":"2016-02-22T15:38:42Z","abstract_excerpt":"This paper studies codes that correct bursts of deletions. Namely, a code will be called a $b$-burst-deletion-correcting code if it can correct a deletion of any $b$ consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically $\\log(n)+b-1$, the redundancy of the best code construction by Cheng et al. is $b(\\log (n/b+1))$. In this paper we close on this gap and provide codes with redundancy at most $\\log(n) + (b-1)\\log(\\log(n)) +b -\\log(b)$.\n  We also derive a non-asymptotic upper bound on the size of $b$-burst-deletion-correcting codes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06820","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":""},"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":"1602.06820","created_at":"2026-05-18T01:14:58.537794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06820v2","created_at":"2026-05-18T01:14:58.537794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06820","created_at":"2026-05-18T01:14:58.537794+00:00"},{"alias_kind":"pith_short_12","alias_value":"THGQEMKQL2TG","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"THGQEMKQL2TGU527","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"THGQEMKQ","created_at":"2026-05-18T12:30:44.179134+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/THGQEMKQL2TGU52726XKT2Z6VE","json":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE.json","graph_json":"https://pith.science/api/pith-number/THGQEMKQL2TGU52726XKT2Z6VE/graph.json","events_json":"https://pith.science/api/pith-number/THGQEMKQL2TGU52726XKT2Z6VE/events.json","paper":"https://pith.science/paper/THGQEMKQ"},"agent_actions":{"view_html":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE","download_json":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE.json","view_paper":"https://pith.science/paper/THGQEMKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06820&json=true","fetch_graph":"https://pith.science/api/pith-number/THGQEMKQL2TGU52726XKT2Z6VE/graph.json","fetch_events":"https://pith.science/api/pith-number/THGQEMKQL2TGU52726XKT2Z6VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE/action/storage_attestation","attest_author":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE/action/author_attestation","sign_citation":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE/action/citation_signature","submit_replication":"https://pith.science/pith/THGQEMKQL2TGU52726XKT2Z6VE/action/replication_record"}},"created_at":"2026-05-18T01:14:58.537794+00:00","updated_at":"2026-05-18T01:14:58.537794+00:00"}