{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ETWRHMQ4PITFCS3Y34IWP752AY","short_pith_number":"pith:ETWRHMQ4","schema_version":"1.0","canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","source":{"kind":"arxiv","id":"1511.07070","version":2},"attestation_state":"computed","paper":{"title":"Which Regular Expression Patterns are Hard to Match?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arturs Backurs, Piotr Indyk","submitted_at":"2015-11-22T21:10:49Z","abstract_excerpt":"Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton corresponding to the expression, resulting in an $O(mn)$ running time (where $m$ is the length of the pattern and $n$ is the length of the text). This running time can be improved slightly (by a polylogarithmic factor), but no significantly faster solutions are known. At the same time, much faster algorithms exist for various special cases of regul"},"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":"1511.07070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-22T21:10:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"41de33dba5d4d3696519f5142b7d38321fa31f342136b016ad800cdb028f66a3","abstract_canon_sha256":"a2d3ac6d92582a9954ea438da38e056e6700645d582f6ad82eccae6d5ae07312"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:50.849660Z","signature_b64":"Y6EfwfInUpq9xXVzilZhh1E866JCcrbNzaLfmUDHmjRkf+mitYgel3OvfigUJLdilYlFqGfuF18KiJBtUw/cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","last_reissued_at":"2026-05-18T01:03:50.848960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:50.848960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which Regular Expression Patterns are Hard to Match?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arturs Backurs, Piotr Indyk","submitted_at":"2015-11-22T21:10:49Z","abstract_excerpt":"Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton corresponding to the expression, resulting in an $O(mn)$ running time (where $m$ is the length of the pattern and $n$ is the length of the text). This running time can be improved slightly (by a polylogarithmic factor), but no significantly faster solutions are known. At the same time, much faster algorithms exist for various special cases of regul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07070","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":"1511.07070","created_at":"2026-05-18T01:03:50.849075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07070v2","created_at":"2026-05-18T01:03:50.849075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07070","created_at":"2026-05-18T01:03:50.849075+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETWRHMQ4PITF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETWRHMQ4PITFCS3Y","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETWRHMQ4","created_at":"2026-05-18T12:29:19.899920+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/ETWRHMQ4PITFCS3Y34IWP752AY","json":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY.json","graph_json":"https://pith.science/api/pith-number/ETWRHMQ4PITFCS3Y34IWP752AY/graph.json","events_json":"https://pith.science/api/pith-number/ETWRHMQ4PITFCS3Y34IWP752AY/events.json","paper":"https://pith.science/paper/ETWRHMQ4"},"agent_actions":{"view_html":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY","download_json":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY.json","view_paper":"https://pith.science/paper/ETWRHMQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07070&json=true","fetch_graph":"https://pith.science/api/pith-number/ETWRHMQ4PITFCS3Y34IWP752AY/graph.json","fetch_events":"https://pith.science/api/pith-number/ETWRHMQ4PITFCS3Y34IWP752AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/action/storage_attestation","attest_author":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/action/author_attestation","sign_citation":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/action/citation_signature","submit_replication":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/action/replication_record"}},"created_at":"2026-05-18T01:03:50.849075+00:00","updated_at":"2026-05-18T01:03:50.849075+00:00"}