{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7CTNSZDCTYXL6YY4QDEUEQPTVK","short_pith_number":"pith:7CTNSZDC","canonical_record":{"source":{"id":"1806.04645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-12T16:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"05a13a7d7fd9e2ac67efe04f7dc13982e0cffa7ed3b1d3497762a77e087db751","abstract_canon_sha256":"3a3b364756aeb96fc773a7bd709a3d36a35f84f47a6a39a47566d3a7a17056f5"},"schema_version":"1.0"},"canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","source":{"kind":"arxiv","id":"1806.04645","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04645","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04645v2","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04645","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"7CTNSZDCTYXL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7CTNSZDCTYXL6YY4","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7CTNSZDC","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7CTNSZDCTYXL6YY4QDEUEQPTVK","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-12T16:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"05a13a7d7fd9e2ac67efe04f7dc13982e0cffa7ed3b1d3497762a77e087db751","abstract_canon_sha256":"3a3b364756aeb96fc773a7bd709a3d36a35f84f47a6a39a47566d3a7a17056f5"},"schema_version":"1.0"},"canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:38.221513Z","signature_b64":"TTGBTG7F789uHR8VB2Pp2qixzjGdkHZMtgAeVQ78nuzxgcA3b+wwaRFno4KUtHQD8Hbk/pYHNnGLwJCUqn2nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","last_reissued_at":"2026-05-18T00:01:38.221035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:38.221035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04645","source_version":2,"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:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYOnH/jASpKWD5WQUsVPO+rIigeYvmyidNj3R38zFSFoJS7REzVL8EGT3eE78yA1p0SAJe/xqWpRZtq93PI2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:44:22.322144Z"},"content_sha256":"e0370741a17b04fe5c052311a92b32c732b6dade55998db77f90fd63a13e6785","schema_version":"1.0","event_id":"sha256:e0370741a17b04fe5c052311a92b32c732b6dade55998db77f90fd63a13e6785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7CTNSZDCTYXL6YY4QDEUEQPTVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State Complexity of Pattern Matching in Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Abhishek Madan, Janusz A. Brzozowski, Sylvie Davies","submitted_at":"2018-06-12T16:59:13Z","abstract_excerpt":"In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set $T$ of texts, where $P$ and $T$ are regular languages. We are interested whether any word of $T$ begins with a word of $P$, ends with a word of $P$, has a word of $P$ as a factor, or has a word of $P$ as a subsequence. Thus we are interested in the languages $(P\\Sigma^*)\\cap T$, $(\\Sigma^*P)\\cap T$, $(\\Sigma^* P\\Sigma^*)\\cap T$, and $(\\Sigma^* \\mathbin{\\ope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04645","kind":"arxiv","version":2},"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:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBQXIFrY57ZJ906fFZXp729TzySJSZ73f4h9ciY5kHQkzQCu1zM9Xj5CiZzinA78Iu0o9YD/KMLyobom6ftgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:44:22.322715Z"},"content_sha256":"2cd9ef0fa12542168a117f40b4a167e68745796de8bc7f291ddf29b8be599bbf","schema_version":"1.0","event_id":"sha256:2cd9ef0fa12542168a117f40b4a167e68745796de8bc7f291ddf29b8be599bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/bundle.json","state_url":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/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-28T10:44:22Z","links":{"resolver":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK","bundle":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/bundle.json","state":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7CTNSZDCTYXL6YY4QDEUEQPTVK","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":"3a3b364756aeb96fc773a7bd709a3d36a35f84f47a6a39a47566d3a7a17056f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-12T16:59:13Z","title_canon_sha256":"05a13a7d7fd9e2ac67efe04f7dc13982e0cffa7ed3b1d3497762a77e087db751"},"schema_version":"1.0","source":{"id":"1806.04645","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04645","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04645v2","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04645","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"7CTNSZDCTYXL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7CTNSZDCTYXL6YY4","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7CTNSZDC","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:2cd9ef0fa12542168a117f40b4a167e68745796de8bc7f291ddf29b8be599bbf","target":"graph","created_at":"2026-05-18T00:01:38Z","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":"In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set $T$ of texts, where $P$ and $T$ are regular languages. We are interested whether any word of $T$ begins with a word of $P$, ends with a word of $P$, has a word of $P$ as a factor, or has a word of $P$ as a subsequence. Thus we are interested in the languages $(P\\Sigma^*)\\cap T$, $(\\Sigma^*P)\\cap T$, $(\\Sigma^* P\\Sigma^*)\\cap T$, and $(\\Sigma^* \\mathbin{\\ope","authors_text":"Abhishek Madan, Janusz A. Brzozowski, Sylvie Davies","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-12T16:59:13Z","title":"State Complexity of Pattern Matching in Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04645","kind":"arxiv","version":2},"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:e0370741a17b04fe5c052311a92b32c732b6dade55998db77f90fd63a13e6785","target":"record","created_at":"2026-05-18T00:01:38Z","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":"3a3b364756aeb96fc773a7bd709a3d36a35f84f47a6a39a47566d3a7a17056f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-12T16:59:13Z","title_canon_sha256":"05a13a7d7fd9e2ac67efe04f7dc13982e0cffa7ed3b1d3497762a77e087db751"},"schema_version":"1.0","source":{"id":"1806.04645","kind":"arxiv","version":2}},"canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","first_computed_at":"2026-05-18T00:01:38.221035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:38.221035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TTGBTG7F789uHR8VB2Pp2qixzjGdkHZMtgAeVQ78nuzxgcA3b+wwaRFno4KUtHQD8Hbk/pYHNnGLwJCUqn2nAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:38.221513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04645","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0370741a17b04fe5c052311a92b32c732b6dade55998db77f90fd63a13e6785","sha256:2cd9ef0fa12542168a117f40b4a167e68745796de8bc7f291ddf29b8be599bbf"],"state_sha256":"3a8f27512037ed1b2d3dbd9bff3641ec9e31f827649983943b6a2027975489b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yr7+dnUu2xjU8A8IeInXfsc8XlGOey8s4wo2sN42NL4qKKlnyif6q0t/cfd3QmSCIXjAc5gYu6N8avupAom6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:44:22.325298Z","bundle_sha256":"8f9a29da45df0c941ffff9b8246cbad95c68c1618106798c4a4c0d83d4a18520"}}