{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TSKZBG3MFHDPD2SC2K7QAIV4IE","short_pith_number":"pith:TSKZBG3M","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"},"canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","source":{"kind":"arxiv","id":"1604.08860","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08860","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08860v4","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08860","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"TSKZBG3MFHDP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TSKZBG3MFHDPD2SC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TSKZBG3M","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TSKZBG3MFHDPD2SC2K7QAIV4IE","target":"record","payload":{"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"},"canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","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"},"source_kind":"arxiv","source_id":"1604.08860","source_version":4,"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZY7za8ysfFOaDXseu50OhfC8HYh5YeaDke/zEXp9dff6QWF2JPWXcbuCbyCId4IGF9xVZT+ITCtzp6m0L1AeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:09.749371Z"},"content_sha256":"f026a9efe5ab642f5d63bcfc0cf636e5bcd0efca4e48a3352beed5d879f42ed2","schema_version":"1.0","event_id":"sha256:f026a9efe5ab642f5d63bcfc0cf636e5bcd0efca4e48a3352beed5d879f42ed2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TSKZBG3MFHDPD2SC2K7QAIV4IE","target":"graph","payload":{"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"},"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XW7Ihv1mCUx/+mxr+7sZmh/t5xav5Um4xNr16C7mfRuyDdabiO9Qtt3OoF2A+nxftNbI/mvd+Yjqk0ExqPPcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:09.749725Z"},"content_sha256":"5fab8120f8944cf9afc8f00ddb8fc244eda2e670b40e66b16b8659edecc4c9bd","schema_version":"1.0","event_id":"sha256:5fab8120f8944cf9afc8f00ddb8fc244eda2e670b40e66b16b8659edecc4c9bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/bundle.json","state_url":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/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-04T19:17:09Z","links":{"resolver":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE","bundle":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/bundle.json","state":"https://pith.science/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSKZBG3MFHDPD2SC2K7QAIV4IE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TSKZBG3MFHDPD2SC2K7QAIV4IE","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":"c8f522b83e8c49bad181e07e3cc009ba8abb4ddfc5d7bac6ab52c43d77877822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T14:31:49Z","title_canon_sha256":"90dc539ff35aa866bc65e94f5c7fa30e25961ad248aed7b70c4871d72188ff1a"},"schema_version":"1.0","source":{"id":"1604.08860","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08860","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08860v4","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08860","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"TSKZBG3MFHDP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TSKZBG3MFHDPD2SC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TSKZBG3M","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5fab8120f8944cf9afc8f00ddb8fc244eda2e670b40e66b16b8659edecc4c9bd","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"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","authors_text":"Gilles Didier, Laurent Tichit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T14:31:49Z","title":"Designing optimal- and fast-on-average pattern matching algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08860","kind":"arxiv","version":4},"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:f026a9efe5ab642f5d63bcfc0cf636e5bcd0efca4e48a3352beed5d879f42ed2","target":"record","created_at":"2026-05-18T00:56:37Z","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":"c8f522b83e8c49bad181e07e3cc009ba8abb4ddfc5d7bac6ab52c43d77877822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T14:31:49Z","title_canon_sha256":"90dc539ff35aa866bc65e94f5c7fa30e25961ad248aed7b70c4871d72188ff1a"},"schema_version":"1.0","source":{"id":"1604.08860","kind":"arxiv","version":4}},"canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c95909b6c29c6f1ea42d2bf0022bc413b36f4618523fe4b28b9275aad923406","first_computed_at":"2026-05-18T00:56:37.882144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.882144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V9rjTS8DSyjMcd7BD5q99G0P1P5PGFH/E50jlE26/cjHzosRKGpFfmRJ7U/SHnNhFnNba5fW1cLu+iDFGU1IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.882798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08860","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f026a9efe5ab642f5d63bcfc0cf636e5bcd0efca4e48a3352beed5d879f42ed2","sha256:5fab8120f8944cf9afc8f00ddb8fc244eda2e670b40e66b16b8659edecc4c9bd"],"state_sha256":"8ae49cf133dd4f6d0d0e303634f34bb4cbae2fca3637b91450c302a2cebfd05e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpL6bCbJS1GdLSRNWS6rpkZ3d0ZimlHhwWMsyWbPJgnT1TPsV1GT54Vb3fJAm3if5rpFrexToPuginKBaTpJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:17:09.751812Z","bundle_sha256":"7388b4efb1931bee3b9e1564551d2459ec5cdf61e3022c7ad3e30ff1bc108398"}}