{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UL33KX646KSQ4QYPBVCHY3GRMJ","short_pith_number":"pith:UL33KX64","canonical_record":{"source":{"id":"1607.00138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-01T07:44:07Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"71b07019b95b7955f6d3377fce4e1a537f475c3929b0bd0f7845a29c25c130b2","abstract_canon_sha256":"d0e89f71487fbbc201efdc7993134eef50df0bb26c35577470a9f82439796dd8"},"schema_version":"1.0"},"canonical_sha256":"a2f7b55fdcf2a50e430f0d447c6cd1624be4e8c03c59d62cc40b740a58ddf2d0","source":{"kind":"arxiv","id":"1607.00138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00138","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00138v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00138","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"UL33KX646KSQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UL33KX646KSQ4QYP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UL33KX64","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UL33KX646KSQ4QYPBVCHY3GRMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-01T07:44:07Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"71b07019b95b7955f6d3377fce4e1a537f475c3929b0bd0f7845a29c25c130b2","abstract_canon_sha256":"d0e89f71487fbbc201efdc7993134eef50df0bb26c35577470a9f82439796dd8"},"schema_version":"1.0"},"canonical_sha256":"a2f7b55fdcf2a50e430f0d447c6cd1624be4e8c03c59d62cc40b740a58ddf2d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.993109Z","signature_b64":"CVYGJ6ZxqAeruYRj6KlpdfbUvfWtXgasmrZzhyoYxSApnECQkjDP0zfFgMJTPscBIkddAzWvelYFNeqRPihmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f7b55fdcf2a50e430f0d447c6cd1624be4e8c03c59d62cc40b740a58ddf2d0","last_reissued_at":"2026-05-18T01:11:37.992611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.992611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00138","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqZ17kkYcpcfsoQoct6GZV6yGC/47PD2H+aRFzn4n6bwicguyWamxWI3SzxvS11aLTATC+tUcQg0vHcC1jRwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:00:47.603930Z"},"content_sha256":"ad481d659d140d61b87f8002bd1119cd4f2ae04e614b6fc1456699c88ef9e1e8","schema_version":"1.0","event_id":"sha256:ad481d659d140d61b87f8002bd1119cd4f2ae04e614b6fc1456699c88ef9e1e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UL33KX646KSQ4QYPBVCHY3GRMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representing Pattern Matching Algorithms by Polynomial-Size Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Noemi E. Passing, Tobias Marschall","submitted_at":"2016-07-01T07:44:07Z","abstract_excerpt":"Pattern matching algorithms to find exact occurrences of a pattern $S\\in\\Sigma^m$ in a text $T\\in\\Sigma^n$ have been analyzed extensively with respect to asymptotic best, worst, and average case runtime. For more detailed analyses, the number of text character accesses $X^{\\mathcal{A},S}_n$ performed by an algorithm $\\mathcal{A}$ when searching a random text of length $n$ for a fixed pattern $S$ has been considered. Constructing a state space and corresponding transition rules (e.g. in a Markov chain) that reflect the behavior of a pattern matching algorithm is a key step in existing analyses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00138","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt5jUyUWid941ZAM1GIEfeq82sb8TDSG3HOyZYCeiNKgQZkJ+PxiYfQpWp8fXFC6U+03dV+T10DezLA3+ZTZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:00:47.604557Z"},"content_sha256":"15f0c9267a996cd40aafaf1aacaaa2845029f2f3273505edff223a7dd12c5155","schema_version":"1.0","event_id":"sha256:15f0c9267a996cd40aafaf1aacaaa2845029f2f3273505edff223a7dd12c5155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/bundle.json","state_url":"https://pith.science/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/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-09T16:00:47Z","links":{"resolver":"https://pith.science/pith/UL33KX646KSQ4QYPBVCHY3GRMJ","bundle":"https://pith.science/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/bundle.json","state":"https://pith.science/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UL33KX646KSQ4QYPBVCHY3GRMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UL33KX646KSQ4QYPBVCHY3GRMJ","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":"d0e89f71487fbbc201efdc7993134eef50df0bb26c35577470a9f82439796dd8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-01T07:44:07Z","title_canon_sha256":"71b07019b95b7955f6d3377fce4e1a537f475c3929b0bd0f7845a29c25c130b2"},"schema_version":"1.0","source":{"id":"1607.00138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00138","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00138v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00138","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"UL33KX646KSQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UL33KX646KSQ4QYP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UL33KX64","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:15f0c9267a996cd40aafaf1aacaaa2845029f2f3273505edff223a7dd12c5155","target":"graph","created_at":"2026-05-18T01:11: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":"Pattern matching algorithms to find exact occurrences of a pattern $S\\in\\Sigma^m$ in a text $T\\in\\Sigma^n$ have been analyzed extensively with respect to asymptotic best, worst, and average case runtime. For more detailed analyses, the number of text character accesses $X^{\\mathcal{A},S}_n$ performed by an algorithm $\\mathcal{A}$ when searching a random text of length $n$ for a fixed pattern $S$ has been considered. Constructing a state space and corresponding transition rules (e.g. in a Markov chain) that reflect the behavior of a pattern matching algorithm is a key step in existing analyses ","authors_text":"Noemi E. Passing, Tobias Marschall","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-01T07:44:07Z","title":"Representing Pattern Matching Algorithms by Polynomial-Size Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00138","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:ad481d659d140d61b87f8002bd1119cd4f2ae04e614b6fc1456699c88ef9e1e8","target":"record","created_at":"2026-05-18T01:11: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":"d0e89f71487fbbc201efdc7993134eef50df0bb26c35577470a9f82439796dd8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-01T07:44:07Z","title_canon_sha256":"71b07019b95b7955f6d3377fce4e1a537f475c3929b0bd0f7845a29c25c130b2"},"schema_version":"1.0","source":{"id":"1607.00138","kind":"arxiv","version":1}},"canonical_sha256":"a2f7b55fdcf2a50e430f0d447c6cd1624be4e8c03c59d62cc40b740a58ddf2d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2f7b55fdcf2a50e430f0d447c6cd1624be4e8c03c59d62cc40b740a58ddf2d0","first_computed_at":"2026-05-18T01:11:37.992611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:37.992611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVYGJ6ZxqAeruYRj6KlpdfbUvfWtXgasmrZzhyoYxSApnECQkjDP0zfFgMJTPscBIkddAzWvelYFNeqRPihmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:37.993109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad481d659d140d61b87f8002bd1119cd4f2ae04e614b6fc1456699c88ef9e1e8","sha256:15f0c9267a996cd40aafaf1aacaaa2845029f2f3273505edff223a7dd12c5155"],"state_sha256":"78e78b3765a7c95ca3f76149b22bb592a57c6e36f31864205bd1d052808787d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uepBBf/Om8EK6eQWU51e7zq9MYIQcWuAomlgyoRXBasdBeO+KllULLXl6pu8vHyqAST11lT8roHWoab90Q+wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:00:47.607401Z","bundle_sha256":"d8c7dc48bd869c28306c15e67695519a8001d414fad05a9abd873dd2fb510b52"}}