{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UK7XL3PLYZFOFW7S537I7PYODI","short_pith_number":"pith:UK7XL3PL","schema_version":"1.0","canonical_sha256":"a2bf75edebc64ae2dbf2eefe8fbf0e1a0806af9621992696878014760e6c8081","source":{"kind":"arxiv","id":"1210.5093","version":2},"attestation_state":"computed","paper":{"title":"A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DC","authors_text":"Bernd Burgstaller, Minyoung Jung, Yo-Sub Han, Yousun Ko","submitted_at":"2012-10-18T11:17:23Z","abstract_excerpt":"We present techniques to parallelize membership tests for Deterministic Finite Automata (DFAs). Our method searches arbitrary regular expressions by matching multiple bytes in parallel using speculation. We partition the input string into chunks, match chunks in parallel, and combine the matching results. Our parallel matching algorithm exploits structural DFA properties to minimize the speculative overhead. Unlike previous approaches, our speculation is failure-free, i.e., (1) sequential semantics are maintained, and (2) speed-downs are avoided altogether. On architectures with a SIMD gather-"},"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":"1210.5093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T11:17:23Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"eab9d1495bcd770bb63896fc1d99f9ff240deca823b049aef2e45841ff597d61","abstract_canon_sha256":"36159d7e407361b1f49c0016b6231523e8ba5f6777f206733197bd07e1fd4ccb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:57.127709Z","signature_b64":"sxseEsE6QNUzXQE7G+nF6Yr+554K7aqn1W0umJoXEvt1tlDCA3z6Ntfm91LDuTP8E7WUPd64BPMX+kKhxbw5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2bf75edebc64ae2dbf2eefe8fbf0e1a0806af9621992696878014760e6c8081","last_reissued_at":"2026-05-18T03:17:57.126903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:57.126903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DC","authors_text":"Bernd Burgstaller, Minyoung Jung, Yo-Sub Han, Yousun Ko","submitted_at":"2012-10-18T11:17:23Z","abstract_excerpt":"We present techniques to parallelize membership tests for Deterministic Finite Automata (DFAs). Our method searches arbitrary regular expressions by matching multiple bytes in parallel using speculation. We partition the input string into chunks, match chunks in parallel, and combine the matching results. Our parallel matching algorithm exploits structural DFA properties to minimize the speculative overhead. Unlike previous approaches, our speculation is failure-free, i.e., (1) sequential semantics are maintained, and (2) speed-downs are avoided altogether. On architectures with a SIMD gather-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5093","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":"1210.5093","created_at":"2026-05-18T03:17:57.127058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5093v2","created_at":"2026-05-18T03:17:57.127058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5093","created_at":"2026-05-18T03:17:57.127058+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK7XL3PLYZFO","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK7XL3PLYZFOFW7S","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK7XL3PL","created_at":"2026-05-18T12:27:23.164592+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/UK7XL3PLYZFOFW7S537I7PYODI","json":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI.json","graph_json":"https://pith.science/api/pith-number/UK7XL3PLYZFOFW7S537I7PYODI/graph.json","events_json":"https://pith.science/api/pith-number/UK7XL3PLYZFOFW7S537I7PYODI/events.json","paper":"https://pith.science/paper/UK7XL3PL"},"agent_actions":{"view_html":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI","download_json":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI.json","view_paper":"https://pith.science/paper/UK7XL3PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5093&json=true","fetch_graph":"https://pith.science/api/pith-number/UK7XL3PLYZFOFW7S537I7PYODI/graph.json","fetch_events":"https://pith.science/api/pith-number/UK7XL3PLYZFOFW7S537I7PYODI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI/action/storage_attestation","attest_author":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI/action/author_attestation","sign_citation":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI/action/citation_signature","submit_replication":"https://pith.science/pith/UK7XL3PLYZFOFW7S537I7PYODI/action/replication_record"}},"created_at":"2026-05-18T03:17:57.127058+00:00","updated_at":"2026-05-18T03:17:57.127058+00:00"}