{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KTXUYUBYDUVDIV5A6WK6HPXO5V","short_pith_number":"pith:KTXUYUBY","canonical_record":{"source":{"id":"1108.1228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-04T23:14:25Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"701357c7401ec50644a4929ce58445013b53a6838b571722d2f0b9947f6ea20e","abstract_canon_sha256":"c34f9fb7d12a21efc0ca6be75731759402e26cca44c12e3b7a0be78610855ee1"},"schema_version":"1.0"},"canonical_sha256":"54ef4c50381d2a3457a0f595e3beeeed4f93cc2213998d5e94db14c19f295c0e","source":{"kind":"arxiv","id":"1108.1228","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1228","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1228v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1228","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"KTXUYUBYDUVD","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KTXUYUBYDUVDIV5A","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KTXUYUBY","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KTXUYUBYDUVDIV5A6WK6HPXO5V","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-04T23:14:25Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"701357c7401ec50644a4929ce58445013b53a6838b571722d2f0b9947f6ea20e","abstract_canon_sha256":"c34f9fb7d12a21efc0ca6be75731759402e26cca44c12e3b7a0be78610855ee1"},"schema_version":"1.0"},"canonical_sha256":"54ef4c50381d2a3457a0f595e3beeeed4f93cc2213998d5e94db14c19f295c0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.801485Z","signature_b64":"RqPbZiKph1ielK919rFX2qcLjb4NngnCnnf0TDU8zZN7sbNOUCcK6IWS4bOe6Z9g1ZzbH2532zCG4j98MN7VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ef4c50381d2a3457a0f595e3beeeed4f93cc2213998d5e94db14c19f295c0e","last_reissued_at":"2026-05-18T04:15:35.801106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.801106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1228","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-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHFkDONFDpa0eGk3faLDUkty+rdeYCNC4dMUfyLplGI3/+RQKT7FkS6V39sU4NE+qdCHeKqitJ0S5pYMK9PhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:04:44.140158Z"},"content_sha256":"f5937523e990ff82215bdc085b0d211d88494c6022947eee8e403c784143ec1f","schema_version":"1.0","event_id":"sha256:f5937523e990ff82215bdc085b0d211d88494c6022947eee8e403c784143ec1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KTXUYUBYDUVDIV5A6WK6HPXO5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An index for regular expression queries: Design and implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Dominic Tsang, Sanjay Chawla","submitted_at":"2011-08-04T23:14:25Z","abstract_excerpt":"The like regular expression predicate has been part of the SQL standard since at least 1989. However, despite its popularity and wide usage, database vendors provide only limited indexing support for regular expression queries which almost always require a full table scan.\n  In this paper we propose a rigorous and robust approach for providing indexing support for regular expression queries. Our approach consists of formulating the indexing problem as a combinatorial optimization problem. We begin with a database, abstracted as a collection of strings. From this data set we generate a query wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1228","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-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nTBvZO25wQYrq16JFEWwSEpRiqkCmRbvYlkOmVhjbxlaKhmFD88w9x3rhbYTJTBpf5EdmaB6YOPlKJJRY0RMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:04:44.140895Z"},"content_sha256":"bdc37fdca222a6c60310c3926ffc273ad7ea720f965d757e6cd15b610ac59b80","schema_version":"1.0","event_id":"sha256:bdc37fdca222a6c60310c3926ffc273ad7ea720f965d757e6cd15b610ac59b80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/bundle.json","state_url":"https://pith.science/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/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-07T06:04:44Z","links":{"resolver":"https://pith.science/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V","bundle":"https://pith.science/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/bundle.json","state":"https://pith.science/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTXUYUBYDUVDIV5A6WK6HPXO5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KTXUYUBYDUVDIV5A6WK6HPXO5V","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":"c34f9fb7d12a21efc0ca6be75731759402e26cca44c12e3b7a0be78610855ee1","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-04T23:14:25Z","title_canon_sha256":"701357c7401ec50644a4929ce58445013b53a6838b571722d2f0b9947f6ea20e"},"schema_version":"1.0","source":{"id":"1108.1228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1228","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1228v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1228","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"KTXUYUBYDUVD","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KTXUYUBYDUVDIV5A","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KTXUYUBY","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:bdc37fdca222a6c60310c3926ffc273ad7ea720f965d757e6cd15b610ac59b80","target":"graph","created_at":"2026-05-18T04:15:35Z","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":"The like regular expression predicate has been part of the SQL standard since at least 1989. However, despite its popularity and wide usage, database vendors provide only limited indexing support for regular expression queries which almost always require a full table scan.\n  In this paper we propose a rigorous and robust approach for providing indexing support for regular expression queries. Our approach consists of formulating the indexing problem as a combinatorial optimization problem. We begin with a database, abstracted as a collection of strings. From this data set we generate a query wo","authors_text":"Dominic Tsang, Sanjay Chawla","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-04T23:14:25Z","title":"An index for regular expression queries: Design and implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1228","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:f5937523e990ff82215bdc085b0d211d88494c6022947eee8e403c784143ec1f","target":"record","created_at":"2026-05-18T04:15:35Z","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":"c34f9fb7d12a21efc0ca6be75731759402e26cca44c12e3b7a0be78610855ee1","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-04T23:14:25Z","title_canon_sha256":"701357c7401ec50644a4929ce58445013b53a6838b571722d2f0b9947f6ea20e"},"schema_version":"1.0","source":{"id":"1108.1228","kind":"arxiv","version":2}},"canonical_sha256":"54ef4c50381d2a3457a0f595e3beeeed4f93cc2213998d5e94db14c19f295c0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ef4c50381d2a3457a0f595e3beeeed4f93cc2213998d5e94db14c19f295c0e","first_computed_at":"2026-05-18T04:15:35.801106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:35.801106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RqPbZiKph1ielK919rFX2qcLjb4NngnCnnf0TDU8zZN7sbNOUCcK6IWS4bOe6Z9g1ZzbH2532zCG4j98MN7VAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:35.801485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5937523e990ff82215bdc085b0d211d88494c6022947eee8e403c784143ec1f","sha256:bdc37fdca222a6c60310c3926ffc273ad7ea720f965d757e6cd15b610ac59b80"],"state_sha256":"8efbfe102ae93a0b34e4f4b2b2fb4b589b8a94113986cbc4ad113ec0aeb3176b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUcjhxj/TeYmAvhYcVJfoWeddLDd173SfZko6Ujgy3NCB9Y/FJSyhxixZIvNlICcNMwfqNJdZEvulOLlm1b3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:04:44.144684Z","bundle_sha256":"1957bb45bb9d87edbd1f9152765a31342f5a45fd57afdb539b036e90c4da2828"}}