{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQNQABXQTEUMX6QK5QGXBWANKW","short_pith_number":"pith:EQNQABXQ","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"},"canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","source":{"kind":"arxiv","id":"1810.11863","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11863","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11863v2","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11863","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"EQNQABXQTEUM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQNQABXQTEUMX6QK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQNQABXQ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQNQABXQTEUMX6QK5QGXBWANKW","target":"record","payload":{"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"},"canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","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"},"source_kind":"arxiv","source_id":"1810.11863","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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0K8aZGsrMOcJY+SmWzZhNBKEVRp130Y8ebJ5Gne1RjZiA15hl33+sUZo/wfgjuGcwUxR37XEkPn5KckRjIMmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:57:53.235628Z"},"content_sha256":"56c3f6690052c389a34a871b0665239bc97ae4ea610a385faad96209981d625f","schema_version":"1.0","event_id":"sha256:56c3f6690052c389a34a871b0665239bc97ae4ea610a385faad96209981d625f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQNQABXQTEUMX6QK5QGXBWANKW","target":"graph","payload":{"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"},"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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw1MJbLPri5/gNtvTBeTnBdLQmviAwyL4hYmz29lVBJTAnFx+WS37L1jpNq7YyfhjC3j8TdsrPqEB8NujzAsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:57:53.235997Z"},"content_sha256":"b1eb6bdbcf8d5f26473a8d4883cb5563c57744bdb90ab7635768bda0807ec8ec","schema_version":"1.0","event_id":"sha256:b1eb6bdbcf8d5f26473a8d4883cb5563c57744bdb90ab7635768bda0807ec8ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/bundle.json","state_url":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQNQABXQTEUMX6QK5QGXBWANKW/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-22T17:57:53Z","links":{"resolver":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW","bundle":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/bundle.json","state":"https://pith.science/pith/EQNQABXQTEUMX6QK5QGXBWANKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQNQABXQTEUMX6QK5QGXBWANKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQNQABXQTEUMX6QK5QGXBWANKW","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":"c0f955258a48cbf503d0ce55daf6c16d4155e7c69eb63839f4e6a8721df80ad1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-28T19:21:33Z","title_canon_sha256":"a43ebc8bceaad7bed376dbdff20759f446f615c60d784273cd90072b291d46b9"},"schema_version":"1.0","source":{"id":"1810.11863","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11863","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11863v2","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11863","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"EQNQABXQTEUM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQNQABXQTEUMX6QK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQNQABXQ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:b1eb6bdbcf8d5f26473a8d4883cb5563c57744bdb90ab7635768bda0807ec8ec","target":"graph","created_at":"2026-05-17T23:48:57Z","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 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+","authors_text":"Amirbehshad Shahrasbi, Aviad Rubinstein, Bernhard Haeupler","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-28T19:21:33Z","title":"Near-Linear Time Insertion-Deletion Codes and (1+$\\varepsilon$)-Approximating Edit Distance via Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11863","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:56c3f6690052c389a34a871b0665239bc97ae4ea610a385faad96209981d625f","target":"record","created_at":"2026-05-17T23:48:57Z","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":"c0f955258a48cbf503d0ce55daf6c16d4155e7c69eb63839f4e6a8721df80ad1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-28T19:21:33Z","title_canon_sha256":"a43ebc8bceaad7bed376dbdff20759f446f615c60d784273cd90072b291d46b9"},"schema_version":"1.0","source":{"id":"1810.11863","kind":"arxiv","version":2}},"canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"241b0006f09928cbfa0aec0d70d80d558b80973ab593ecd71c1a21040b5aa6ae","first_computed_at":"2026-05-17T23:48:57.997732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:57.997732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrwyPp6FumOhhe0P1lHTxXQ81Idh7WsJx/9t5IVC/6h3PULbybOIiyHVvTfySTgVKyVONP68EtZuHdJ8MzqlBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:57.998493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11863","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56c3f6690052c389a34a871b0665239bc97ae4ea610a385faad96209981d625f","sha256:b1eb6bdbcf8d5f26473a8d4883cb5563c57744bdb90ab7635768bda0807ec8ec"],"state_sha256":"034093c5bb3f73024de14bf698c28305c56d9bf3954c131ba4fc8208eed0dece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EE0sJpXO6Oxs/1MtMXrznV6wHrkervj71+ZnX5s1Wsy8FoOaFW4na51Mt3Qko87ozwHqnAjSjx7FjGO8oKVjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:57:53.238012Z","bundle_sha256":"287c6736c8e26f0b4363cc335c240077f41e9c57559960734091996e0dab4ebd"}}