{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3H2ZBLMSR2R76GLHOPHJ4PMCXO","short_pith_number":"pith:3H2ZBLMS","canonical_record":{"source":{"id":"2305.18575","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2023-05-29T19:37:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7c10d81ff069d0522e421c5fd3f416394b7af0c6206394fd6dc208fccb723263","abstract_canon_sha256":"3a6280a179f1415444d01338f1cf4f36963ca4ab4873515a8c6093c7e7969f7b"},"schema_version":"1.0"},"canonical_sha256":"d9f590ad928ea3ff196773ce9e3d82bbad92a1a2f36112e1abd405e96e8ce3d3","source":{"kind":"arxiv","id":"2305.18575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18575","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18575v1","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18575","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"3H2ZBLMSR2R7","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_16","alias_value":"3H2ZBLMSR2R76GLH","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_8","alias_value":"3H2ZBLMS","created_at":"2026-07-05T06:15:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3H2ZBLMSR2R76GLHOPHJ4PMCXO","target":"record","payload":{"canonical_record":{"source":{"id":"2305.18575","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2023-05-29T19:37:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7c10d81ff069d0522e421c5fd3f416394b7af0c6206394fd6dc208fccb723263","abstract_canon_sha256":"3a6280a179f1415444d01338f1cf4f36963ca4ab4873515a8c6093c7e7969f7b"},"schema_version":"1.0"},"canonical_sha256":"d9f590ad928ea3ff196773ce9e3d82bbad92a1a2f36112e1abd405e96e8ce3d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:02.364877Z","signature_b64":"Tknbaf3cS+WKyS/Q76dSdnlE/leelqSNLH6g0Oj5tkJ6lzrM/LYRSI2VliNZiqMA2AUS2+b/Oj3+YBQ1b2A0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9f590ad928ea3ff196773ce9e3d82bbad92a1a2f36112e1abd405e96e8ce3d3","last_reissued_at":"2026-07-05T06:15:02.364451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:02.364451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.18575","source_version":1,"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-05T06:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krYSQhfuOEk8DwRIA8gBnUy0AtUqDQwADFWgyx16tEr0Th2WCNxWPZxMMWYawvPUtOCL75k9RSlTS9l6SjRABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T14:35:42.317602Z"},"content_sha256":"0f6a091ce1232f96bf826e574262d87d9896ce4a42068840510e223b47927944","schema_version":"1.0","event_id":"sha256:0f6a091ce1232f96bf826e574262d87d9896ce4a42068840510e223b47927944"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3H2ZBLMSR2R76GLHOPHJ4PMCXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search-Based Regular Expression Inference on a GPU","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Martin Berger, Mojtaba Valizadeh","submitted_at":"2023-05-29T19:37:15Z","abstract_excerpt":"Regular expression inference (REI) is a supervised machine learning and program synthesis problem that takes a cost metric for regular expressions, and positive and negative examples of strings as input. It outputs a regular expression that is precise (i.e., accepts all positive and rejects all negative examples), and minimal w.r.t. to the cost metric. We present a novel algorithm for REI over arbitrary alphabets that is enumerative and trades off time for space. Our main algorithmic idea is to implement the search space of regular expressions succinctly as a contiguous matrix of bitvectors. C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18575","kind":"arxiv","version":1},"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/2305.18575/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-05T06:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjTggSVJ7SLvXcbluapOmfnTHWL7pW77kUVAKmuSe2bsMjHQmmlslwqAfUB7cdVsQGes+IhK6Z+q/BtZKFYvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T14:35:42.317968Z"},"content_sha256":"8356e63efad9357d94cc1a264fd1987c82f6448a4d13f50bb5ccf26b02ae8709","schema_version":"1.0","event_id":"sha256:8356e63efad9357d94cc1a264fd1987c82f6448a4d13f50bb5ccf26b02ae8709"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/bundle.json","state_url":"https://pith.science/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/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-07-24T14:35:42Z","links":{"resolver":"https://pith.science/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO","bundle":"https://pith.science/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/bundle.json","state":"https://pith.science/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3H2ZBLMSR2R76GLHOPHJ4PMCXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3H2ZBLMSR2R76GLHOPHJ4PMCXO","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":"3a6280a179f1415444d01338f1cf4f36963ca4ab4873515a8c6093c7e7969f7b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2023-05-29T19:37:15Z","title_canon_sha256":"7c10d81ff069d0522e421c5fd3f416394b7af0c6206394fd6dc208fccb723263"},"schema_version":"1.0","source":{"id":"2305.18575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18575","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18575v1","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18575","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"3H2ZBLMSR2R7","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_16","alias_value":"3H2ZBLMSR2R76GLH","created_at":"2026-07-05T06:15:02Z"},{"alias_kind":"pith_short_8","alias_value":"3H2ZBLMS","created_at":"2026-07-05T06:15:02Z"}],"graph_snapshots":[{"event_id":"sha256:8356e63efad9357d94cc1a264fd1987c82f6448a4d13f50bb5ccf26b02ae8709","target":"graph","created_at":"2026-07-05T06:15:02Z","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/2305.18575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Regular expression inference (REI) is a supervised machine learning and program synthesis problem that takes a cost metric for regular expressions, and positive and negative examples of strings as input. It outputs a regular expression that is precise (i.e., accepts all positive and rejects all negative examples), and minimal w.r.t. to the cost metric. We present a novel algorithm for REI over arbitrary alphabets that is enumerative and trades off time for space. Our main algorithmic idea is to implement the search space of regular expressions succinctly as a contiguous matrix of bitvectors. C","authors_text":"Martin Berger, Mojtaba Valizadeh","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2023-05-29T19:37:15Z","title":"Search-Based Regular Expression Inference on a GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18575","kind":"arxiv","version":1},"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:0f6a091ce1232f96bf826e574262d87d9896ce4a42068840510e223b47927944","target":"record","created_at":"2026-07-05T06:15:02Z","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":"3a6280a179f1415444d01338f1cf4f36963ca4ab4873515a8c6093c7e7969f7b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2023-05-29T19:37:15Z","title_canon_sha256":"7c10d81ff069d0522e421c5fd3f416394b7af0c6206394fd6dc208fccb723263"},"schema_version":"1.0","source":{"id":"2305.18575","kind":"arxiv","version":1}},"canonical_sha256":"d9f590ad928ea3ff196773ce9e3d82bbad92a1a2f36112e1abd405e96e8ce3d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9f590ad928ea3ff196773ce9e3d82bbad92a1a2f36112e1abd405e96e8ce3d3","first_computed_at":"2026-07-05T06:15:02.364451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:15:02.364451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tknbaf3cS+WKyS/Q76dSdnlE/leelqSNLH6g0Oj5tkJ6lzrM/LYRSI2VliNZiqMA2AUS2+b/Oj3+YBQ1b2A0DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:15:02.364877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.18575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f6a091ce1232f96bf826e574262d87d9896ce4a42068840510e223b47927944","sha256:8356e63efad9357d94cc1a264fd1987c82f6448a4d13f50bb5ccf26b02ae8709"],"state_sha256":"b28427ff6d80e8bf16c93d39844944b00c1c084101ec3d3d4eb757333b66735f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gf87C+fKK6LRoIaKLxkk5Xd11Tjlp+Wptoc3x2a63hVyLaNEw0+Pd2SmEcS+Zigk1cSEuz981Kemo/32Yd4XBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T14:35:42.320347Z","bundle_sha256":"8a42a4a2707b8ca153dab659763df04cc49c1bef150245020fdbd53014546330"}}