{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E7LRCONDQ5OYGKLZ4ITZWHGDFJ","short_pith_number":"pith:E7LRCOND","canonical_record":{"source":{"id":"1405.0562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-03T09:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"fe839a3512dd6e4ec5eee9ec51ab2007f61054c6f305adc7e3df473f822f38d8","abstract_canon_sha256":"cafba13b6947d14bccab5a1472449759dbfb0b7d94067285f8ee125044aaaf13"},"schema_version":"1.0"},"canonical_sha256":"27d71139a3875d832979e2279b1cc32a79cb9d3b1832e45f1ca7bbf212aa5294","source":{"kind":"arxiv","id":"1405.0562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0562","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0562v1","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0562","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"E7LRCONDQ5OY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E7LRCONDQ5OYGKLZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E7LRCOND","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E7LRCONDQ5OYGKLZ4ITZWHGDFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-03T09:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"fe839a3512dd6e4ec5eee9ec51ab2007f61054c6f305adc7e3df473f822f38d8","abstract_canon_sha256":"cafba13b6947d14bccab5a1472449759dbfb0b7d94067285f8ee125044aaaf13"},"schema_version":"1.0"},"canonical_sha256":"27d71139a3875d832979e2279b1cc32a79cb9d3b1832e45f1ca7bbf212aa5294","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:41.187968Z","signature_b64":"Y/YvqecS6L8O73IOkMnHfjPisA/27DDVIWacMw0V3ls/DllaelTMvdMevFNQQfLWJn9+aog3r0i/LcXyAl/rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d71139a3875d832979e2279b1cc32a79cb9d3b1832e45f1ca7bbf212aa5294","last_reissued_at":"2026-05-18T02:52:41.187544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:41.187544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0562","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-05-18T02:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"595UtkO/VXvtodg75imggIuA47CAcshN70T2iZWDOv4wOHUcaLdoOmcd39UFWGispLLMH1aSNnOeyjrLQuc1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:46.128777Z"},"content_sha256":"c0da361638085c828d46ad68796786866023724fb7c73fa6b918a87c9afbebcb","schema_version":"1.0","event_id":"sha256:c0da361638085c828d46ad68796786866023724fb7c73fa6b918a87c9afbebcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E7LRCONDQ5OYGKLZ4ITZWHGDFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kiminori Matsuzaki, Masataka Sassa, Ryoma Sin'ya","submitted_at":"2014-05-03T09:35:47Z","abstract_excerpt":"Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating transitions, its implementation has a large overhead due to the simulation. In this paper we propose a new automaton called simultaneous finite automaton (SFA) for efficient parallel computation of an automaton. The key idea is to extend an automaton so that it involves the simulation of transitions. Since an SFA itself has a good property of parall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0562","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":""},"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-18T02:52:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4h/eMXI11UOKYW+XxXV9gRzjjy4kbgD3G3xl6NCtSlg0XM8NfaxX7g6d7tWXEVBEQvZSHvL7Mvu0swAZWtHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:46.129135Z"},"content_sha256":"48384507bc83b4bf85197d159a2990204f41ce822c8cda4c636986ef5a00d360","schema_version":"1.0","event_id":"sha256:48384507bc83b4bf85197d159a2990204f41ce822c8cda4c636986ef5a00d360"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/bundle.json","state_url":"https://pith.science/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/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-02T21:37:46Z","links":{"resolver":"https://pith.science/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ","bundle":"https://pith.science/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/bundle.json","state":"https://pith.science/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7LRCONDQ5OYGKLZ4ITZWHGDFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E7LRCONDQ5OYGKLZ4ITZWHGDFJ","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":"cafba13b6947d14bccab5a1472449759dbfb0b7d94067285f8ee125044aaaf13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-03T09:35:47Z","title_canon_sha256":"fe839a3512dd6e4ec5eee9ec51ab2007f61054c6f305adc7e3df473f822f38d8"},"schema_version":"1.0","source":{"id":"1405.0562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0562","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0562v1","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0562","created_at":"2026-05-18T02:52:41Z"},{"alias_kind":"pith_short_12","alias_value":"E7LRCONDQ5OY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E7LRCONDQ5OYGKLZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E7LRCOND","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:48384507bc83b4bf85197d159a2990204f41ce822c8cda4c636986ef5a00d360","target":"graph","created_at":"2026-05-18T02:52:41Z","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":"Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating transitions, its implementation has a large overhead due to the simulation. In this paper we propose a new automaton called simultaneous finite automaton (SFA) for efficient parallel computation of an automaton. The key idea is to extend an automaton so that it involves the simulation of transitions. Since an SFA itself has a good property of parall","authors_text":"Kiminori Matsuzaki, Masataka Sassa, Ryoma Sin'ya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-03T09:35:47Z","title":"Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0562","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:c0da361638085c828d46ad68796786866023724fb7c73fa6b918a87c9afbebcb","target":"record","created_at":"2026-05-18T02:52:41Z","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":"cafba13b6947d14bccab5a1472449759dbfb0b7d94067285f8ee125044aaaf13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-03T09:35:47Z","title_canon_sha256":"fe839a3512dd6e4ec5eee9ec51ab2007f61054c6f305adc7e3df473f822f38d8"},"schema_version":"1.0","source":{"id":"1405.0562","kind":"arxiv","version":1}},"canonical_sha256":"27d71139a3875d832979e2279b1cc32a79cb9d3b1832e45f1ca7bbf212aa5294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d71139a3875d832979e2279b1cc32a79cb9d3b1832e45f1ca7bbf212aa5294","first_computed_at":"2026-05-18T02:52:41.187544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:41.187544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/YvqecS6L8O73IOkMnHfjPisA/27DDVIWacMw0V3ls/DllaelTMvdMevFNQQfLWJn9+aog3r0i/LcXyAl/rDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:41.187968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0da361638085c828d46ad68796786866023724fb7c73fa6b918a87c9afbebcb","sha256:48384507bc83b4bf85197d159a2990204f41ce822c8cda4c636986ef5a00d360"],"state_sha256":"3d379e82932798a61fc84e6e81111b617481902fc8b7b5457b764fc4fde0b567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mxkf9gA+9TpNs9qlBOG5PXTCX8P4smKDsU3rE/woLFhm38ST/JgfQprznh90U4SbS+85a0Wo+OiBs6LHULqSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:37:46.131101Z","bundle_sha256":"d9ee1168a34ce24c3a59937a48dbfa95b417937c5d8f867496529742f9019003"}}