{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQNQABXQTEUMX6QK5QGXBWANKW","short_pith_number":"pith:EQNQABXQ","schema_version":"1.0","canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","source":{"kind":"arxiv","id":"1810.11863","version":2},"attestation_state":"computed","paper":{"title":"Near-Linear Time Insertion-Deletion Codes and (1+$\\varepsilon$)-Approximating Edit Distance via Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Amirbehshad Shahrasbi, Aviad Rubinstein, Bernhard Haeupler","submitted_at":"2018-10-28T19:21:33Z","abstract_excerpt":"We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$. In particular, for every length $n$ and every $\\varepsilon >0$, one can in near linear time construct a string $I \\in \\Sigma'^n$ with $|\\Sigma'| = O_{\\varepsilon}(1)$, such that, indexing any string $S \\in \\Sigma^n$, symbol-by-symbol, with $I$ results in a string $S' \\in \\Sigma''^n$ where $\\Sigma'' = \\Sigma \\times \\Sigma'$ for which edit distance computations are easy, i.e., one can compute a $(1+"},"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":"1810.11863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-28T19:21:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a43ebc8bceaad7bed376dbdff20759f446f615c60d784273cd90072b291d46b9","abstract_canon_sha256":"c0f955258a48cbf503d0ce55daf6c16d4155e7c69eb63839f4e6a8721df80ad1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:57.998493Z","signature_b64":"SrwyPp6FumOhhe0P1lHTxXQ81Idh7WsJx/9t5IVC/6h3PULbybOIiyHVvTfySTgVKyVONP68EtZuHdJ8MzqlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","last_reissued_at":"2026-05-17T23:48:57.997732Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:57.997732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Time Insertion-Deletion Codes and (1+$\\varepsilon$)-Approximating Edit Distance via Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Amirbehshad Shahrasbi, Aviad Rubinstein, Bernhard Haeupler","submitted_at":"2018-10-28T19:21:33Z","abstract_excerpt":"We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$. In particular, for every length $n$ and every $\\varepsilon >0$, one can in near linear time construct a string $I \\in \\Sigma'^n$ with $|\\Sigma'| = O_{\\varepsilon}(1)$, such that, indexing any string $S \\in \\Sigma^n$, symbol-by-symbol, with $I$ results in a string $S' \\in \\Sigma''^n$ where $\\Sigma'' = \\Sigma \\times \\Sigma'$ for which edit distance computations are easy, i.e., one can compute a $(1+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11863","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":"1810.11863","created_at":"2026-05-17T23:48:57.997871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11863v2","created_at":"2026-05-17T23:48:57.997871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11863","created_at":"2026-05-17T23:48:57.997871+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQNQABXQTEUM","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQNQABXQTEUMX6QK","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQNQABXQ","created_at":"2026-05-18T12:32:22.470017+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/EQNQABXQTEUMX6QK5QGXBWANKW","json":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW.json","graph_json":"https://pith.science/api/pith-number/EQNQABXQTEUMX6QK5QGXBWANKW/graph.json","events_json":"https://pith.science/api/pith-number/EQNQABXQTEUMX6QK5QGXBWANKW/events.json","paper":"https://pith.science/paper/EQNQABXQ"},"agent_actions":{"view_html":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW","download_json":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW.json","view_paper":"https://pith.science/paper/EQNQABXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11863&json=true","fetch_graph":"https://pith.science/api/pith-number/EQNQABXQTEUMX6QK5QGXBWANKW/graph.json","fetch_events":"https://pith.science/api/pith-number/EQNQABXQTEUMX6QK5QGXBWANKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/action/storage_attestation","attest_author":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/action/author_attestation","sign_citation":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/action/citation_signature","submit_replication":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/action/replication_record"}},"created_at":"2026-05-17T23:48:57.997871+00:00","updated_at":"2026-05-17T23:48:57.997871+00:00"}