{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7TS5W7CJQRHLKQT53HGDY5H3CQ","short_pith_number":"pith:7TS5W7CJ","schema_version":"1.0","canonical_sha256":"fce5db7c49844eb5427dd9cc3c74fb14154bc6e0b9834742fd124d41aa5e05ea","source":{"kind":"arxiv","id":"1701.08688","version":1},"attestation_state":"computed","paper":{"title":"Approximate String Matching: Theory and Applications (La Recherche Approch\\'ee de Motifs : Th\\'eorie et Applications)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ibrahim Chegrane","submitted_at":"2017-01-30T16:32:41Z","abstract_excerpt":"The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows:\n  Let $D=\\{x_1,x_2,\\ldots x_d\\}$ be a set of $d$ words defined on an alphabet $\\Sigma$, let $q$ be a query defined also on $\\Sigma$, and let $k$ be a positive integer. We want to build a data structure on $D$ capable of answering the following query: find all words in $D$ that are at most different from the query word $q$ with $k$ errors.\n  In this thesis, we study the approximate string matching methods in dictionaries, texts, and indexes,"},"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":"1701.08688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-30T16:32:41Z","cross_cats_sorted":[],"title_canon_sha256":"b17f2b51ce76562472ca4a137c59631b592832b10a3bb964086230d6b344b5ed","abstract_canon_sha256":"40225c5ce1a95328ff7c8b128c41495c4e548af7d875853eb9dcbe0bba4297fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:52.965846Z","signature_b64":"u5IxLiKXpJ57jjrq/qVKMVzkziZeW4ezfb4C8x1jph9hkx1+0Opf13UYI4fOH7NYnWPgEFfyA1Tz0B0ngcFVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce5db7c49844eb5427dd9cc3c74fb14154bc6e0b9834742fd124d41aa5e05ea","last_reissued_at":"2026-05-18T00:51:52.965199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:52.965199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate String Matching: Theory and Applications (La Recherche Approch\\'ee de Motifs : Th\\'eorie et Applications)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ibrahim Chegrane","submitted_at":"2017-01-30T16:32:41Z","abstract_excerpt":"The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows:\n  Let $D=\\{x_1,x_2,\\ldots x_d\\}$ be a set of $d$ words defined on an alphabet $\\Sigma$, let $q$ be a query defined also on $\\Sigma$, and let $k$ be a positive integer. We want to build a data structure on $D$ capable of answering the following query: find all words in $D$ that are at most different from the query word $q$ with $k$ errors.\n  In this thesis, we study the approximate string matching methods in dictionaries, texts, and indexes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08688","kind":"arxiv","version":1},"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":"1701.08688","created_at":"2026-05-18T00:51:52.965310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08688v1","created_at":"2026-05-18T00:51:52.965310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08688","created_at":"2026-05-18T00:51:52.965310+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TS5W7CJQRHL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TS5W7CJQRHLKQT5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TS5W7CJ","created_at":"2026-05-18T12:31:05.417338+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/7TS5W7CJQRHLKQT53HGDY5H3CQ","json":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ.json","graph_json":"https://pith.science/api/pith-number/7TS5W7CJQRHLKQT53HGDY5H3CQ/graph.json","events_json":"https://pith.science/api/pith-number/7TS5W7CJQRHLKQT53HGDY5H3CQ/events.json","paper":"https://pith.science/paper/7TS5W7CJ"},"agent_actions":{"view_html":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ","download_json":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ.json","view_paper":"https://pith.science/paper/7TS5W7CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08688&json=true","fetch_graph":"https://pith.science/api/pith-number/7TS5W7CJQRHLKQT53HGDY5H3CQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7TS5W7CJQRHLKQT53HGDY5H3CQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ/action/storage_attestation","attest_author":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ/action/author_attestation","sign_citation":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ/action/citation_signature","submit_replication":"https://pith.science/pith/7TS5W7CJQRHLKQT53HGDY5H3CQ/action/replication_record"}},"created_at":"2026-05-18T00:51:52.965310+00:00","updated_at":"2026-05-18T00:51:52.965310+00:00"}