{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NZRTBOQOJTLXOL4FTZKTUD5T6C","short_pith_number":"pith:NZRTBOQO","schema_version":"1.0","canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","source":{"kind":"arxiv","id":"1312.4678","version":2},"attestation_state":"computed","paper":{"title":"Simple, compact and robust approximate string dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Ibrahim Chegrane","submitted_at":"2013-12-17T07:54:49Z","abstract_excerpt":"This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\\sigma$. Given a bound $k$ and a pattern $x$ of length $m$, a query has to return all the strings of the dictionary which are at edit distance at most $k$ from $x$, where the edit distance between two strings $x$ and $y$ is defined as the minimum-cost sequence of edit operations that transform $x$ into $y$. The cost of a sequence of operations is defined as the sum of the"},"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":"1312.4678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"86d4c19aa226d9dbc6098bcae7135856115b040beb3161ee748d484636fe0cf5","abstract_canon_sha256":"5d3353627463d213fe818b517fac96c5d7476c8c0af6b8c012c46aad91b3fd3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.600338Z","signature_b64":"gB8PFWzeyLqdRLyJhjyIHXU1f30Ai/gIbFDQYG/r6nUNyvlKDMoA9xHHjPUZ4sBknwnKnHs3s0X146FosVnlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","last_reissued_at":"2026-05-18T02:44:31.599743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.599743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple, compact and robust approximate string dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Ibrahim Chegrane","submitted_at":"2013-12-17T07:54:49Z","abstract_excerpt":"This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\\sigma$. Given a bound $k$ and a pattern $x$ of length $m$, a query has to return all the strings of the dictionary which are at edit distance at most $k$ from $x$, where the edit distance between two strings $x$ and $y$ is defined as the minimum-cost sequence of edit operations that transform $x$ into $y$. The cost of a sequence of operations is defined as the sum of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4678","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":"1312.4678","created_at":"2026-05-18T02:44:31.599829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4678v2","created_at":"2026-05-18T02:44:31.599829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4678","created_at":"2026-05-18T02:44:31.599829+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZRTBOQOJTLX","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZRTBOQOJTLXOL4F","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZRTBOQO","created_at":"2026-05-18T12:27:54.935989+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/NZRTBOQOJTLXOL4FTZKTUD5T6C","json":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C.json","graph_json":"https://pith.science/api/pith-number/NZRTBOQOJTLXOL4FTZKTUD5T6C/graph.json","events_json":"https://pith.science/api/pith-number/NZRTBOQOJTLXOL4FTZKTUD5T6C/events.json","paper":"https://pith.science/paper/NZRTBOQO"},"agent_actions":{"view_html":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C","download_json":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C.json","view_paper":"https://pith.science/paper/NZRTBOQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4678&json=true","fetch_graph":"https://pith.science/api/pith-number/NZRTBOQOJTLXOL4FTZKTUD5T6C/graph.json","fetch_events":"https://pith.science/api/pith-number/NZRTBOQOJTLXOL4FTZKTUD5T6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/action/storage_attestation","attest_author":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/action/author_attestation","sign_citation":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/action/citation_signature","submit_replication":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/action/replication_record"}},"created_at":"2026-05-18T02:44:31.599829+00:00","updated_at":"2026-05-18T02:44:31.599829+00:00"}