{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XCNBATQVAQNX2XZWOJQC4LI2FK","short_pith_number":"pith:XCNBATQV","canonical_record":{"source":{"id":"2008.02769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-06T17:13:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"15e10e1eb898c6873d24c790618577048890e4d863c19dd04a9bebd451947a7e","abstract_canon_sha256":"b0dc1ea1c18ef3a7b20aca7a88db09930b4d631a79b0cba277671fe57f5d1a47"},"schema_version":"1.0"},"canonical_sha256":"b89a104e15041b7d5f3672602e2d1a2aac27f031099aa7c2e53aadc84e20ca0f","source":{"kind":"arxiv","id":"2008.02769","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02769","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02769v2","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02769","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"XCNBATQVAQNX","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"XCNBATQVAQNX2XZW","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"XCNBATQV","created_at":"2026-07-05T01:36:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XCNBATQVAQNX2XZWOJQC4LI2FK","target":"record","payload":{"canonical_record":{"source":{"id":"2008.02769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-06T17:13:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"15e10e1eb898c6873d24c790618577048890e4d863c19dd04a9bebd451947a7e","abstract_canon_sha256":"b0dc1ea1c18ef3a7b20aca7a88db09930b4d631a79b0cba277671fe57f5d1a47"},"schema_version":"1.0"},"canonical_sha256":"b89a104e15041b7d5f3672602e2d1a2aac27f031099aa7c2e53aadc84e20ca0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:51.306183Z","signature_b64":"WQXzr/A0OdXCm9CdqB9gwM1Lw4gBu46ULBxifHXM1qnO5zv+jXRoWj9B6bLin597PVq24ml3oIefpCrxIAwiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89a104e15041b7d5f3672602e2d1a2aac27f031099aa7c2e53aadc84e20ca0f","last_reissued_at":"2026-07-05T01:36:51.305821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:51.305821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.02769","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-07-05T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7EOcg4g1QMXrzgojTHICR6kL09mTN3en7bZf/tLkDM+R/+uuOHIDMmfo1wWyyqpQZKe8TTrgtDZJD42cTU9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:49:47.700247Z"},"content_sha256":"50a9eb27fc124744d81d4a8802d491c50555ea152038ef3501d2964a4af63da2","schema_version":"1.0","event_id":"sha256:50a9eb27fc124744d81d4a8802d491c50555ea152038ef3501d2964a4af63da2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XCNBATQVAQNX2XZWOJQC4LI2FK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fine-Grained Complexity of Regular Expression Pattern Matching and Membership","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Philipp Schepper","submitted_at":"2020-08-06T17:13:58Z","abstract_excerpt":"The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous patterns of bounded depth in this work. For them a classification splitting the types in easy (strongly sub-quadratic) and hard (essentially quadratic time under SETH) is known. We take a very fine-grained look at the hard pattern types from this classification and show a dichotomy: few types allow super-poly-logarithmic improvements while the algorithms for the other p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02769","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.02769/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ngebpOmYN8/p81LVV4c7WwzyH4j5kEJyLNhuSxs6UDqR+uHG8nqPudsPSe0qh4VbtTB7p0y1vt4CuNli2CEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:49:47.701712Z"},"content_sha256":"3998936233f19ec0d487478471449fb569a41fb00fd2af26676bb9dacef2ce63","schema_version":"1.0","event_id":"sha256:3998936233f19ec0d487478471449fb569a41fb00fd2af26676bb9dacef2ce63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/bundle.json","state_url":"https://pith.science/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/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-08-17T17:49:47Z","links":{"resolver":"https://pith.science/pith/XCNBATQVAQNX2XZWOJQC4LI2FK","bundle":"https://pith.science/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/bundle.json","state":"https://pith.science/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCNBATQVAQNX2XZWOJQC4LI2FK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XCNBATQVAQNX2XZWOJQC4LI2FK","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":"b0dc1ea1c18ef3a7b20aca7a88db09930b4d631a79b0cba277671fe57f5d1a47","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-06T17:13:58Z","title_canon_sha256":"15e10e1eb898c6873d24c790618577048890e4d863c19dd04a9bebd451947a7e"},"schema_version":"1.0","source":{"id":"2008.02769","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02769","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02769v2","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02769","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"XCNBATQVAQNX","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"XCNBATQVAQNX2XZW","created_at":"2026-07-05T01:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"XCNBATQV","created_at":"2026-07-05T01:36:51Z"}],"graph_snapshots":[{"event_id":"sha256:3998936233f19ec0d487478471449fb569a41fb00fd2af26676bb9dacef2ce63","target":"graph","created_at":"2026-07-05T01:36:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.02769/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous patterns of bounded depth in this work. For them a classification splitting the types in easy (strongly sub-quadratic) and hard (essentially quadratic time under SETH) is known. We take a very fine-grained look at the hard pattern types from this classification and show a dichotomy: few types allow super-poly-logarithmic improvements while the algorithms for the other p","authors_text":"Philipp Schepper","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-06T17:13:58Z","title":"Fine-Grained Complexity of Regular Expression Pattern Matching and Membership"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02769","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:50a9eb27fc124744d81d4a8802d491c50555ea152038ef3501d2964a4af63da2","target":"record","created_at":"2026-07-05T01:36:51Z","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":"b0dc1ea1c18ef3a7b20aca7a88db09930b4d631a79b0cba277671fe57f5d1a47","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-06T17:13:58Z","title_canon_sha256":"15e10e1eb898c6873d24c790618577048890e4d863c19dd04a9bebd451947a7e"},"schema_version":"1.0","source":{"id":"2008.02769","kind":"arxiv","version":2}},"canonical_sha256":"b89a104e15041b7d5f3672602e2d1a2aac27f031099aa7c2e53aadc84e20ca0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89a104e15041b7d5f3672602e2d1a2aac27f031099aa7c2e53aadc84e20ca0f","first_computed_at":"2026-07-05T01:36:51.305821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:36:51.305821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQXzr/A0OdXCm9CdqB9gwM1Lw4gBu46ULBxifHXM1qnO5zv+jXRoWj9B6bLin597PVq24ml3oIefpCrxIAwiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:36:51.306183Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02769","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50a9eb27fc124744d81d4a8802d491c50555ea152038ef3501d2964a4af63da2","sha256:3998936233f19ec0d487478471449fb569a41fb00fd2af26676bb9dacef2ce63"],"state_sha256":"61e6bafe9ae08bf3321d839a4313143144fea42afb742972ab50b898829a829d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTQ17/RFUMgZuch+89HbtFxWX8+SDjuPlVg8VQEC49Oo24RJt0v+IVPDA+A23+e24c+fUAE7hr/BmiMhwPJQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:49:47.708781Z","bundle_sha256":"5e5c7f85fb1c9f8ba8302161ad94ca7143d535dd5306dc9c3be4d27fde2dfb58"}}