{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FN47VPE6SMRPHDTZIUKK4GSXQ4","short_pith_number":"pith:FN47VPE6","schema_version":"1.0","canonical_sha256":"2b79fabc9e9322f38e794514ae1a57871fbf99e05ffdad356970936edac5734e","source":{"kind":"arxiv","id":"1103.2167","version":3},"attestation_state":"computed","paper":{"title":"Improved space-time tradeoffs for approximate full-text indexing with one edit error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2011-03-10T23:25:45Z","abstract_excerpt":"In this paper we are interested in indexing texts for substring matching queries with one edit error. That is, given a text $T$ of $n$ characters over an alphabet of size $\\sigma$, we are asked to build a data structure that answers the following query: find all the $occ$ substrings of the text that are at edit distance at most $1$ from a given string $q$ of length $m$. In this paper we show two new results for this problem. The first result, suitable for an unbounded alphabet, uses $O(n\\log^\\epsilon n)$ (where $\\epsilon$ is any constant such that $0<\\epsilon<1$) words of space and answers to "},"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":"1103.2167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-10T23:25:45Z","cross_cats_sorted":[],"title_canon_sha256":"3c11150e90645995c1e6bb620f5e824490cb6fc239eef85bd8c59039505b3477","abstract_canon_sha256":"fa8982656f7cb37bfdf3950a35aed49855e7df6b2ef8371eb097d818a9d6ed09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.622652Z","signature_b64":"R6RI+W0LN36ZVZ6ogdOkvQdVAVrOi9zx55KX08z2ZzNKVSPnIUpVCBDXiiQA2akRyiCd+/r0Jt1MVkJX41f1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b79fabc9e9322f38e794514ae1a57871fbf99e05ffdad356970936edac5734e","last_reissued_at":"2026-05-18T02:44:40.622057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.622057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved space-time tradeoffs for approximate full-text indexing with one edit error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2011-03-10T23:25:45Z","abstract_excerpt":"In this paper we are interested in indexing texts for substring matching queries with one edit error. That is, given a text $T$ of $n$ characters over an alphabet of size $\\sigma$, we are asked to build a data structure that answers the following query: find all the $occ$ substrings of the text that are at edit distance at most $1$ from a given string $q$ of length $m$. In this paper we show two new results for this problem. The first result, suitable for an unbounded alphabet, uses $O(n\\log^\\epsilon n)$ (where $\\epsilon$ is any constant such that $0<\\epsilon<1$) words of space and answers to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2167","kind":"arxiv","version":3},"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":"1103.2167","created_at":"2026-05-18T02:44:40.622133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2167v3","created_at":"2026-05-18T02:44:40.622133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2167","created_at":"2026-05-18T02:44:40.622133+00:00"},{"alias_kind":"pith_short_12","alias_value":"FN47VPE6SMRP","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FN47VPE6SMRPHDTZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FN47VPE6","created_at":"2026-05-18T12:26:28.662955+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/FN47VPE6SMRPHDTZIUKK4GSXQ4","json":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4.json","graph_json":"https://pith.science/api/pith-number/FN47VPE6SMRPHDTZIUKK4GSXQ4/graph.json","events_json":"https://pith.science/api/pith-number/FN47VPE6SMRPHDTZIUKK4GSXQ4/events.json","paper":"https://pith.science/paper/FN47VPE6"},"agent_actions":{"view_html":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4","download_json":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4.json","view_paper":"https://pith.science/paper/FN47VPE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2167&json=true","fetch_graph":"https://pith.science/api/pith-number/FN47VPE6SMRPHDTZIUKK4GSXQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/FN47VPE6SMRPHDTZIUKK4GSXQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4/action/storage_attestation","attest_author":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4/action/author_attestation","sign_citation":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4/action/citation_signature","submit_replication":"https://pith.science/pith/FN47VPE6SMRPHDTZIUKK4GSXQ4/action/replication_record"}},"created_at":"2026-05-18T02:44:40.622133+00:00","updated_at":"2026-05-18T02:44:40.622133+00:00"}