{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ETWRHMQ4PITFCS3Y34IWP752AY","short_pith_number":"pith:ETWRHMQ4","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"},"canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","source":{"kind":"arxiv","id":"1511.07070","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07070","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07070v2","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07070","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"ETWRHMQ4PITF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ETWRHMQ4PITFCS3Y","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ETWRHMQ4","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ETWRHMQ4PITFCS3Y34IWP752AY","target":"record","payload":{"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"},"canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","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"},"source_kind":"arxiv","source_id":"1511.07070","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-18T01:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+alDh1o32SxUy14zfjw349CQXILJWoYuaFj4GCtssGeqc7vQ+YTTkYuc1J9zT/jQcA6MS7W+cJVdbok0Tw4bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:19.643730Z"},"content_sha256":"78e9078cef32e484c513995b1b64f26d61bcca481a9aed330418c33b65bd143c","schema_version":"1.0","event_id":"sha256:78e9078cef32e484c513995b1b64f26d61bcca481a9aed330418c33b65bd143c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ETWRHMQ4PITFCS3Y34IWP752AY","target":"graph","payload":{"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"},"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:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2UYa+WYUhb7bafpvzelxMlqof8YMAkKRiRcvOYZNMnDFGQuwuDArr9KqUmHaxh4KpFyT+lji6Pyk4cIKILjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:19.644126Z"},"content_sha256":"83390558ec395f668ee1e1f032b23715ce276d40278e2581e829225f576ac89e","schema_version":"1.0","event_id":"sha256:83390558ec395f668ee1e1f032b23715ce276d40278e2581e829225f576ac89e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/bundle.json","state_url":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETWRHMQ4PITFCS3Y34IWP752AY/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-05-30T07:34:19Z","links":{"resolver":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY","bundle":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/bundle.json","state":"https://pith.science/pith/ETWRHMQ4PITFCS3Y34IWP752AY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETWRHMQ4PITFCS3Y34IWP752AY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ETWRHMQ4PITFCS3Y34IWP752AY","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":"a2d3ac6d92582a9954ea438da38e056e6700645d582f6ad82eccae6d5ae07312","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-22T21:10:49Z","title_canon_sha256":"41de33dba5d4d3696519f5142b7d38321fa31f342136b016ad800cdb028f66a3"},"schema_version":"1.0","source":{"id":"1511.07070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07070","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07070v2","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07070","created_at":"2026-05-18T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"ETWRHMQ4PITF","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ETWRHMQ4PITFCS3Y","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ETWRHMQ4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:83390558ec395f668ee1e1f032b23715ce276d40278e2581e829225f576ac89e","target":"graph","created_at":"2026-05-18T01:03:50Z","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":"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","authors_text":"Arturs Backurs, Piotr Indyk","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-22T21:10:49Z","title":"Which Regular Expression Patterns are Hard to Match?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07070","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:78e9078cef32e484c513995b1b64f26d61bcca481a9aed330418c33b65bd143c","target":"record","created_at":"2026-05-18T01:03:50Z","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":"a2d3ac6d92582a9954ea438da38e056e6700645d582f6ad82eccae6d5ae07312","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-22T21:10:49Z","title_canon_sha256":"41de33dba5d4d3696519f5142b7d38321fa31f342136b016ad800cdb028f66a3"},"schema_version":"1.0","source":{"id":"1511.07070","kind":"arxiv","version":2}},"canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24ed13b21c7a26514b78df1167ffba061497e4d00606483abfd951924d5955bc","first_computed_at":"2026-05-18T01:03:50.848960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:50.848960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6EfwfInUpq9xXVzilZhh1E866JCcrbNzaLfmUDHmjRkf+mitYgel3OvfigUJLdilYlFqGfuF18KiJBtUw/cBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:50.849660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e9078cef32e484c513995b1b64f26d61bcca481a9aed330418c33b65bd143c","sha256:83390558ec395f668ee1e1f032b23715ce276d40278e2581e829225f576ac89e"],"state_sha256":"910c1d48c2994cc61f28c25c8055f8fa2d2e2c3e65e066e07fa2a0fabf338da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7XTRPuN8c8X/2Kbw4+wJgGcSr4pOG81VpJmh2Ar/44rZJ/LbqCCBvhe47B4nfVhPwY/JA26Xvq8vJLHVJlWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:34:19.646444Z","bundle_sha256":"08a77f5766fccaf6821bbbaa1df7fd37641c1347f181730faf8b0a4155fd14ac"}}