{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TJRAET24WRDJUXMBXA6TF7LR3N","short_pith_number":"pith:TJRAET24","schema_version":"1.0","canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","source":{"kind":"arxiv","id":"1507.01719","version":2},"attestation_state":"computed","paper":{"title":"An improved bound on the fraction of correctable deletions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Boris Bukh, Johan H{\\aa}stad, Venkatesan Guruswami","submitted_at":"2015-07-07T09:20:06Z","abstract_excerpt":"We consider codes over fixed alphabets against worst-case symbol deletions. For any fixed $k \\ge 2$, we construct a family of codes over alphabet of size $k$ with positive rate, which allow efficient recovery from a worst-case deletion fraction approaching $1-\\frac{2}{k+\\sqrt k}$. In particular, for binary codes, we are able to recover a fraction of deletions approaching $1/(\\sqrt 2 +1)=\\sqrt 2-1 \\approx 0.414$. Previously, even non-constructively the largest deletion fraction known to be correctable with positive rate was $1-\\Theta(1/\\sqrt{k})$, and around $0.17$ for the binary case.\n  Our re"},"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":"1507.01719","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-07-07T09:20:06Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"334ed3c9681a8115ebf2dd037b0c70f0d07b587926b765c311104c7e5931f52a","abstract_canon_sha256":"7b3aad52c32f965113197a0782694463d4780a434961ccd7fae9fcf7cedcdb9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:48.430415Z","signature_b64":"4Fm7PyxbSiZo2OKP2K4OkvHA1bDUcWmY3CpK7OTJuXmUH3K79pL3odrGl/3Da7du3uKgax/RxGdgz/wxzEkXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","last_reissued_at":"2026-05-18T01:19:48.429919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:48.429919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved bound on the fraction of correctable deletions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Boris Bukh, Johan H{\\aa}stad, Venkatesan Guruswami","submitted_at":"2015-07-07T09:20:06Z","abstract_excerpt":"We consider codes over fixed alphabets against worst-case symbol deletions. For any fixed $k \\ge 2$, we construct a family of codes over alphabet of size $k$ with positive rate, which allow efficient recovery from a worst-case deletion fraction approaching $1-\\frac{2}{k+\\sqrt k}$. In particular, for binary codes, we are able to recover a fraction of deletions approaching $1/(\\sqrt 2 +1)=\\sqrt 2-1 \\approx 0.414$. Previously, even non-constructively the largest deletion fraction known to be correctable with positive rate was $1-\\Theta(1/\\sqrt{k})$, and around $0.17$ for the binary case.\n  Our re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01719","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":"1507.01719","created_at":"2026-05-18T01:19:48.429986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01719v2","created_at":"2026-05-18T01:19:48.429986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01719","created_at":"2026-05-18T01:19:48.429986+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJRAET24WRDJ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJRAET24WRDJUXMB","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJRAET24","created_at":"2026-05-18T12:29:42.218222+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/TJRAET24WRDJUXMBXA6TF7LR3N","json":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N.json","graph_json":"https://pith.science/api/pith-number/TJRAET24WRDJUXMBXA6TF7LR3N/graph.json","events_json":"https://pith.science/api/pith-number/TJRAET24WRDJUXMBXA6TF7LR3N/events.json","paper":"https://pith.science/paper/TJRAET24"},"agent_actions":{"view_html":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N","download_json":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N.json","view_paper":"https://pith.science/paper/TJRAET24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01719&json=true","fetch_graph":"https://pith.science/api/pith-number/TJRAET24WRDJUXMBXA6TF7LR3N/graph.json","fetch_events":"https://pith.science/api/pith-number/TJRAET24WRDJUXMBXA6TF7LR3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/action/storage_attestation","attest_author":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/action/author_attestation","sign_citation":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/action/citation_signature","submit_replication":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/action/replication_record"}},"created_at":"2026-05-18T01:19:48.429986+00:00","updated_at":"2026-05-18T01:19:48.429986+00:00"}