{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7TS5W7CJQRHLKQT53HGDY5H3CQ","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":"40225c5ce1a95328ff7c8b128c41495c4e548af7d875853eb9dcbe0bba4297fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-30T16:32:41Z","title_canon_sha256":"b17f2b51ce76562472ca4a137c59631b592832b10a3bb964086230d6b344b5ed"},"schema_version":"1.0","source":{"id":"1701.08688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08688","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08688v1","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08688","created_at":"2026-05-18T00:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"7TS5W7CJQRHL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7TS5W7CJQRHLKQT5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7TS5W7CJ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:f30c387decc3f8bcc372106c8a168fd44dfa7e215a4af382a9f5c6a1e7c15534","target":"graph","created_at":"2026-05-18T00:51:52Z","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":"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,","authors_text":"Ibrahim Chegrane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-30T16:32:41Z","title":"Approximate String Matching: Theory and Applications (La Recherche Approch\\'ee de Motifs : Th\\'eorie et Applications)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08688","kind":"arxiv","version":1},"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:716d94762b56add4505ff7de7c5267f5607aef572fadc0a340d6e8eab5c18d60","target":"record","created_at":"2026-05-18T00:51:52Z","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":"40225c5ce1a95328ff7c8b128c41495c4e548af7d875853eb9dcbe0bba4297fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-30T16:32:41Z","title_canon_sha256":"b17f2b51ce76562472ca4a137c59631b592832b10a3bb964086230d6b344b5ed"},"schema_version":"1.0","source":{"id":"1701.08688","kind":"arxiv","version":1}},"canonical_sha256":"fce5db7c49844eb5427dd9cc3c74fb14154bc6e0b9834742fd124d41aa5e05ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fce5db7c49844eb5427dd9cc3c74fb14154bc6e0b9834742fd124d41aa5e05ea","first_computed_at":"2026-05-18T00:51:52.965199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:52.965199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5IxLiKXpJ57jjrq/qVKMVzkziZeW4ezfb4C8x1jph9hkx1+0Opf13UYI4fOH7NYnWPgEFfyA1Tz0B0ngcFVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:52.965846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:716d94762b56add4505ff7de7c5267f5607aef572fadc0a340d6e8eab5c18d60","sha256:f30c387decc3f8bcc372106c8a168fd44dfa7e215a4af382a9f5c6a1e7c15534"],"state_sha256":"0b6539b5077fdbd6ba4f5e9a47ab2fd3c603c1029adb3fc00fd28d259bad6fe5"}