{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NAY5EHXVSKGWMF5BRNS3MR2DXE","short_pith_number":"pith:NAY5EHXV","schema_version":"1.0","canonical_sha256":"6831d21ef5928d6617a18b65b64743b9336c1ee0905b595f3e00e602509d3842","source":{"kind":"arxiv","id":"1604.08437","version":2},"attestation_state":"computed","paper":{"title":"Optimal pattern matching algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CC","authors_text":"Gilles Didier","submitted_at":"2016-04-28T14:40:53Z","abstract_excerpt":"We study a class of finite state machines, called \\defi{$w$-matching machines}, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern $w$. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern $w$.\n  Defining the order of a matching machine or of an algorithm as the maximum difference between the current and accessed positions during a search (standard algorithms are generally of order $|w|$), we show "},"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":"1604.08437","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-28T14:40:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"fbd755509e63caea29d3d8fca86509cf282b4ba30109a079f3b61a26d881c439","abstract_canon_sha256":"00c4f5816afc412e83a0ae4677692d6c5a10fa252409c5a3ef1cc500360bb2cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:57.139679Z","signature_b64":"uufjpf/8rj8eZsnKkpDwYOHD/OLAOlDqqrY+mNyZS7yFPs1wZocm45+Kh2wvOu5PjW7wXEC1ZUr51ktQO7iGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6831d21ef5928d6617a18b65b64743b9336c1ee0905b595f3e00e602509d3842","last_reissued_at":"2026-05-18T01:15:57.139006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:57.139006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal pattern matching algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CC","authors_text":"Gilles Didier","submitted_at":"2016-04-28T14:40:53Z","abstract_excerpt":"We study a class of finite state machines, called \\defi{$w$-matching machines}, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern $w$. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern $w$.\n  Defining the order of a matching machine or of an algorithm as the maximum difference between the current and accessed positions during a search (standard algorithms are generally of order $|w|$), we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08437","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":"1604.08437","created_at":"2026-05-18T01:15:57.139106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08437v2","created_at":"2026-05-18T01:15:57.139106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08437","created_at":"2026-05-18T01:15:57.139106+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAY5EHXVSKGW","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAY5EHXVSKGWMF5B","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAY5EHXV","created_at":"2026-05-18T12:30:32.724797+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/NAY5EHXVSKGWMF5BRNS3MR2DXE","json":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE.json","graph_json":"https://pith.science/api/pith-number/NAY5EHXVSKGWMF5BRNS3MR2DXE/graph.json","events_json":"https://pith.science/api/pith-number/NAY5EHXVSKGWMF5BRNS3MR2DXE/events.json","paper":"https://pith.science/paper/NAY5EHXV"},"agent_actions":{"view_html":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE","download_json":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE.json","view_paper":"https://pith.science/paper/NAY5EHXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08437&json=true","fetch_graph":"https://pith.science/api/pith-number/NAY5EHXVSKGWMF5BRNS3MR2DXE/graph.json","fetch_events":"https://pith.science/api/pith-number/NAY5EHXVSKGWMF5BRNS3MR2DXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE/action/storage_attestation","attest_author":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE/action/author_attestation","sign_citation":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE/action/citation_signature","submit_replication":"https://pith.science/pith/NAY5EHXVSKGWMF5BRNS3MR2DXE/action/replication_record"}},"created_at":"2026-05-18T01:15:57.139106+00:00","updated_at":"2026-05-18T01:15:57.139106+00:00"}