{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TJRAET24WRDJUXMBXA6TF7LR3N","short_pith_number":"pith:TJRAET24","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"},"canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","source":{"kind":"arxiv","id":"1507.01719","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01719","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01719v2","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01719","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"TJRAET24WRDJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJRAET24WRDJUXMB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJRAET24","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TJRAET24WRDJUXMBXA6TF7LR3N","target":"record","payload":{"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"},"canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","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"},"source_kind":"arxiv","source_id":"1507.01719","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-05-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSvvfESyqXLcJOqmJwk1X6HJ7mtNogYOU+kLzV93FNd1sI+fPB/h6MGxHDiL5ENN9nQVSQJ2OWDE1d5/zdmqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:17.030167Z"},"content_sha256":"7c6731a2675ddeb80d4be1c500dfe1d2a3dafb040b390c9a1267836315710e17","schema_version":"1.0","event_id":"sha256:7c6731a2675ddeb80d4be1c500dfe1d2a3dafb040b390c9a1267836315710e17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TJRAET24WRDJUXMBXA6TF7LR3N","target":"graph","payload":{"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"},"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-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiiDRmYSuVd024og40YJcarXKF5Zf358LjGDG0RFBxGBsOdy1LNHfyzUUH6Y7vWqv98LpQK4CERi5/yLHrB3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:17.030941Z"},"content_sha256":"68c9a51facf60d72f7d21221a0853230f2f7d965d5b2de37e0f68bee3780d7e4","schema_version":"1.0","event_id":"sha256:68c9a51facf60d72f7d21221a0853230f2f7d965d5b2de37e0f68bee3780d7e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/bundle.json","state_url":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJRAET24WRDJUXMBXA6TF7LR3N/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-06-09T08:02:17Z","links":{"resolver":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N","bundle":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/bundle.json","state":"https://pith.science/pith/TJRAET24WRDJUXMBXA6TF7LR3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJRAET24WRDJUXMBXA6TF7LR3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TJRAET24WRDJUXMBXA6TF7LR3N","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":"7b3aad52c32f965113197a0782694463d4780a434961ccd7fae9fcf7cedcdb9c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-07-07T09:20:06Z","title_canon_sha256":"334ed3c9681a8115ebf2dd037b0c70f0d07b587926b765c311104c7e5931f52a"},"schema_version":"1.0","source":{"id":"1507.01719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01719","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01719v2","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01719","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"TJRAET24WRDJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJRAET24WRDJUXMB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJRAET24","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:68c9a51facf60d72f7d21221a0853230f2f7d965d5b2de37e0f68bee3780d7e4","target":"graph","created_at":"2026-05-18T01:19:48Z","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":"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","authors_text":"Boris Bukh, Johan H{\\aa}stad, Venkatesan Guruswami","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-07-07T09:20:06Z","title":"An improved bound on the fraction of correctable deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01719","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:7c6731a2675ddeb80d4be1c500dfe1d2a3dafb040b390c9a1267836315710e17","target":"record","created_at":"2026-05-18T01:19:48Z","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":"7b3aad52c32f965113197a0782694463d4780a434961ccd7fae9fcf7cedcdb9c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-07-07T09:20:06Z","title_canon_sha256":"334ed3c9681a8115ebf2dd037b0c70f0d07b587926b765c311104c7e5931f52a"},"schema_version":"1.0","source":{"id":"1507.01719","kind":"arxiv","version":2}},"canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a62024f5cb4469a5d81b83d32fd71db6bb2a9ad5e622babc01a135c6d326258","first_computed_at":"2026-05-18T01:19:48.429919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:48.429919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Fm7PyxbSiZo2OKP2K4OkvHA1bDUcWmY3CpK7OTJuXmUH3K79pL3odrGl/3Da7du3uKgax/RxGdgz/wxzEkXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:48.430415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c6731a2675ddeb80d4be1c500dfe1d2a3dafb040b390c9a1267836315710e17","sha256:68c9a51facf60d72f7d21221a0853230f2f7d965d5b2de37e0f68bee3780d7e4"],"state_sha256":"6187b6d04d5ce37cd18b4c3d0d314315da3a01aa6d15fea3e3f5d0b225768174"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJkc84Q5O0YUAETgoYenKwws8GEhw8cGBbc4P64935VySo7Y98e+BgqOJ91zbAxZoSKnZO2SerMKEaiHg+iWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:02:17.038779Z","bundle_sha256":"8b32867fd5b2d2c8ea053bd51a8d1b4bffab49946c19d056a100f768ada50fee"}}