{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TSKZBG3MFHDPD2SC2K7QAIV4IE","short_pith_number":"pith:TSKZBG3M","schema_version":"1.0","canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","source":{"kind":"arxiv","id":"1604.08860","version":4},"attestation_state":"computed","paper":{"title":"Designing optimal- and fast-on-average pattern matching algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gilles Didier, Laurent Tichit","submitted_at":"2016-04-28T14:31:49Z","abstract_excerpt":"Given a pattern $w$ and a text $t$, the speed of a pattern matching algorithm over $t$ with regard to $w$, is the ratio of the length of $t$ to the number of text accesses performed to search $w$ into $t$. We first propose a general method for computing the limit of the expected speed of pattern matching algorithms, with regard to $w$, over iid texts. Next, we show how to determine the greatest speed which can be achieved among a large class of algorithms, altogether with an algorithm running this speed. Since the complexity of this determination make it impossible to deal with patterns of len"},"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.08860","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T14:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"90dc539ff35aa866bc65e94f5c7fa30e25961ad248aed7b70c4871d72188ff1a","abstract_canon_sha256":"c8f522b83e8c49bad181e07e3cc009ba8abb4ddfc5d7bac6ab52c43d77877822"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.882798Z","signature_b64":"V9rjTS8DSyjMcd7BD5q99G0P1P5PGFH/E50jlE26/cjHzosRKGpFfmRJ7U/SHnNhFnNba5fW1cLu+iDFGU1IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","last_reissued_at":"2026-05-18T00:56:37.882144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.882144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing optimal- and fast-on-average pattern matching algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gilles Didier, Laurent Tichit","submitted_at":"2016-04-28T14:31:49Z","abstract_excerpt":"Given a pattern $w$ and a text $t$, the speed of a pattern matching algorithm over $t$ with regard to $w$, is the ratio of the length of $t$ to the number of text accesses performed to search $w$ into $t$. We first propose a general method for computing the limit of the expected speed of pattern matching algorithms, with regard to $w$, over iid texts. Next, we show how to determine the greatest speed which can be achieved among a large class of algorithms, altogether with an algorithm running this speed. Since the complexity of this determination make it impossible to deal with patterns of len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08860","kind":"arxiv","version":4},"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.08860","created_at":"2026-05-18T00:56:37.882231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08860v4","created_at":"2026-05-18T00:56:37.882231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08860","created_at":"2026-05-18T00:56:37.882231+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSKZBG3MFHDP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSKZBG3MFHDPD2SC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSKZBG3M","created_at":"2026-05-18T12:30:46.583412+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/TSKZBG3MFHDPD2SC2K7QAIV4IE","json":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE.json","graph_json":"https://pith.science/api/pith-number/TSKZBG3MFHDPD2SC2K7QAIV4IE/graph.json","events_json":"https://pith.science/api/pith-number/TSKZBG3MFHDPD2SC2K7QAIV4IE/events.json","paper":"https://pith.science/paper/TSKZBG3M"},"agent_actions":{"view_html":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE","download_json":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE.json","view_paper":"https://pith.science/paper/TSKZBG3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08860&json=true","fetch_graph":"https://pith.science/api/pith-number/TSKZBG3MFHDPD2SC2K7QAIV4IE/graph.json","fetch_events":"https://pith.science/api/pith-number/TSKZBG3MFHDPD2SC2K7QAIV4IE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/action/storage_attestation","attest_author":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/action/author_attestation","sign_citation":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/action/citation_signature","submit_replication":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/action/replication_record"}},"created_at":"2026-05-18T00:56:37.882231+00:00","updated_at":"2026-05-18T00:56:37.882231+00:00"}