{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E345MM2W5QYHK66EABMIQQAYB3","short_pith_number":"pith:E345MM2W","schema_version":"1.0","canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","source":{"kind":"arxiv","id":"1009.6114","version":1},"attestation_state":"computed","paper":{"title":"Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Sven Rahmann, Tobias Marschall","submitted_at":"2010-09-30T12:22:25Z","abstract_excerpt":"We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer-Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we show how to efficiently obtain the distribution of such an algorithm's running time cost for any given pattern in a random text model, which can be quite general, from simple uniform models to higher-order Markov models or hidden Markov models (HMMs). Furthermore, we provide a technique to compute the exact distribution of \\emph{differences} in running time cost of two algorithms. In"},"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":"1009.6114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-30T12:22:25Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"8b5d4429737440aad31dae4a2e5ccf7200ad96abd8f33ebf00833c57244ee526","abstract_canon_sha256":"7e2f4d04e5ce9db8c3c4fac55213904c04776fbbe565f5cb43041a44da615885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:01.031599Z","signature_b64":"48zT3asTr0EvxorSwNpThi1tuGgnsDiiVD2OAQfLbfZAg6/jsB4uTrQLC8PTUdlUCGS7OEgEA8pAfKG1fT+1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","last_reissued_at":"2026-05-18T04:40:01.031109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:01.031109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Sven Rahmann, Tobias Marschall","submitted_at":"2010-09-30T12:22:25Z","abstract_excerpt":"We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer-Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we show how to efficiently obtain the distribution of such an algorithm's running time cost for any given pattern in a random text model, which can be quite general, from simple uniform models to higher-order Markov models or hidden Markov models (HMMs). Furthermore, we provide a technique to compute the exact distribution of \\emph{differences} in running time cost of two algorithms. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6114","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":"1009.6114","created_at":"2026-05-18T04:40:01.031183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.6114v1","created_at":"2026-05-18T04:40:01.031183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6114","created_at":"2026-05-18T04:40:01.031183+00:00"},{"alias_kind":"pith_short_12","alias_value":"E345MM2W5QYH","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"E345MM2W5QYHK66E","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"E345MM2W","created_at":"2026-05-18T12:26:06.534383+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/E345MM2W5QYHK66EABMIQQAYB3","json":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3.json","graph_json":"https://pith.science/api/pith-number/E345MM2W5QYHK66EABMIQQAYB3/graph.json","events_json":"https://pith.science/api/pith-number/E345MM2W5QYHK66EABMIQQAYB3/events.json","paper":"https://pith.science/paper/E345MM2W"},"agent_actions":{"view_html":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3","download_json":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3.json","view_paper":"https://pith.science/paper/E345MM2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.6114&json=true","fetch_graph":"https://pith.science/api/pith-number/E345MM2W5QYHK66EABMIQQAYB3/graph.json","fetch_events":"https://pith.science/api/pith-number/E345MM2W5QYHK66EABMIQQAYB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/action/storage_attestation","attest_author":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/action/author_attestation","sign_citation":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/action/citation_signature","submit_replication":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/action/replication_record"}},"created_at":"2026-05-18T04:40:01.031183+00:00","updated_at":"2026-05-18T04:40:01.031183+00:00"}