{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7CTNSZDCTYXL6YY4QDEUEQPTVK","short_pith_number":"pith:7CTNSZDC","schema_version":"1.0","canonical_sha256":"f8a6d964629e2ebf631c80c94241f3aab49b573447aeedd7d7b30144a2bfbc6e","source":{"kind":"arxiv","id":"1806.04645","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04645","created_at":"2026-05-18T00:01:38.221110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04645v2","created_at":"2026-05-18T00:01:38.221110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04645","created_at":"2026-05-18T00:01:38.221110+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CTNSZDCTYXL","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CTNSZDCTYXL6YY4","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CTNSZDC","created_at":"2026-05-18T12:32:11.075285+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/7CTNSZDCTYXL6YY4QDEUEQPTVK","json":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK.json","graph_json":"https://pith.science/api/pith-number/7CTNSZDCTYXL6YY4QDEUEQPTVK/graph.json","events_json":"https://pith.science/api/pith-number/7CTNSZDCTYXL6YY4QDEUEQPTVK/events.json","paper":"https://pith.science/paper/7CTNSZDC"},"agent_actions":{"view_html":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK","download_json":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK.json","view_paper":"https://pith.science/paper/7CTNSZDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04645&json=true","fetch_graph":"https://pith.science/api/pith-number/7CTNSZDCTYXL6YY4QDEUEQPTVK/graph.json","fetch_events":"https://pith.science/api/pith-number/7CTNSZDCTYXL6YY4QDEUEQPTVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/action/storage_attestation","attest_author":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/action/author_attestation","sign_citation":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/action/citation_signature","submit_replication":"https://pith.science/pith/7CTNSZDCTYXL6YY4QDEUEQPTVK/action/replication_record"}},"created_at":"2026-05-18T00:01:38.221110+00:00","updated_at":"2026-05-18T00:01:38.221110+00:00"}