{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:E345MM2W5QYHK66EABMIQQAYB3","short_pith_number":"pith:E345MM2W","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"},"canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","source":{"kind":"arxiv","id":"1009.6114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6114","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6114v1","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6114","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"E345MM2W5QYH","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"E345MM2W5QYHK66E","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"E345MM2W","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:E345MM2W5QYHK66EABMIQQAYB3","target":"record","payload":{"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"},"canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","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"},"source_kind":"arxiv","source_id":"1009.6114","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTzC3dCrmZgchiswJE0DV80Kr6R9WMq3HGnhWPUjqMjFX9npOKaOyhiVvJjim7glzcSQc8jD8yPTQdCU/e2uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:36:03.384798Z"},"content_sha256":"b5cea7f595c8e36d1cdd9a5aef6b54b24b708dba956c27ab05797d032cd6b6a5","schema_version":"1.0","event_id":"sha256:b5cea7f595c8e36d1cdd9a5aef6b54b24b708dba956c27ab05797d032cd6b6a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:E345MM2W5QYHK66EABMIQQAYB3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8V/3OhIa7o6vnY61YMCP5TwNNcjaxvMxU0ZvNBzffJakDUEDsWwtf1YrSPX6nFv/JXP9ph5c0HMcM/XDjh7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:36:03.385167Z"},"content_sha256":"566f02a34833ba4f7c790e47a5fb3217b8cb5081efd6551febc9d6e3584fec1e","schema_version":"1.0","event_id":"sha256:566f02a34833ba4f7c790e47a5fb3217b8cb5081efd6551febc9d6e3584fec1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/bundle.json","state_url":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E345MM2W5QYHK66EABMIQQAYB3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T17:36:03Z","links":{"resolver":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3","bundle":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/bundle.json","state":"https://pith.science/pith/E345MM2W5QYHK66EABMIQQAYB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E345MM2W5QYHK66EABMIQQAYB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:E345MM2W5QYHK66EABMIQQAYB3","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":"7e2f4d04e5ce9db8c3c4fac55213904c04776fbbe565f5cb43041a44da615885","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-30T12:22:25Z","title_canon_sha256":"8b5d4429737440aad31dae4a2e5ccf7200ad96abd8f33ebf00833c57244ee526"},"schema_version":"1.0","source":{"id":"1009.6114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6114","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6114v1","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6114","created_at":"2026-05-18T04:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"E345MM2W5QYH","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"E345MM2W5QYHK66E","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"E345MM2W","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:566f02a34833ba4f7c790e47a5fb3217b8cb5081efd6551febc9d6e3584fec1e","target":"graph","created_at":"2026-05-18T04:40:01Z","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":"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","authors_text":"Sven Rahmann, Tobias Marschall","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-30T12:22:25Z","title":"Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6114","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:b5cea7f595c8e36d1cdd9a5aef6b54b24b708dba956c27ab05797d032cd6b6a5","target":"record","created_at":"2026-05-18T04:40:01Z","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":"7e2f4d04e5ce9db8c3c4fac55213904c04776fbbe565f5cb43041a44da615885","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-30T12:22:25Z","title_canon_sha256":"8b5d4429737440aad31dae4a2e5ccf7200ad96abd8f33ebf00833c57244ee526"},"schema_version":"1.0","source":{"id":"1009.6114","kind":"arxiv","version":1}},"canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26f9d63356ec30757bc400588840180ec47c1c258b59c1c6d6aeb9ca45c6b003","first_computed_at":"2026-05-18T04:40:01.031109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:01.031109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48zT3asTr0EvxorSwNpThi1tuGgnsDiiVD2OAQfLbfZAg6/jsB4uTrQLC8PTUdlUCGS7OEgEA8pAfKG1fT+1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:01.031599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5cea7f595c8e36d1cdd9a5aef6b54b24b708dba956c27ab05797d032cd6b6a5","sha256:566f02a34833ba4f7c790e47a5fb3217b8cb5081efd6551febc9d6e3584fec1e"],"state_sha256":"bb402e06bbf071a8930c0ffcd37611e609198986a6e0895e5a4f70fab8f8abf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjoZ0sANK6nLJw4Rqq/xnu8hD4Lqdq989VCr40bhjJU3Hb0wAEW+8LdlxNxDw0y58u03Z4uXSwktI30t0VP8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:36:03.387747Z","bundle_sha256":"c33337c2e83e16ed97a0587994a32c7e2a6e1233cd9970619e4324d22b56024c"}}