{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P5RYFJ7LN62FKJQGP3H5LFZIHH","short_pith_number":"pith:P5RYFJ7L","canonical_record":{"source":{"id":"1512.09228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-31T06:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"ebb51ce72136ae59a18e4b1cc6b6ab0e474e45462843fa021fd5ec3c8fd1e839","abstract_canon_sha256":"acfaac779ab0467d34c039b841c76e747ded3d810a041f8298e1e5980690f36e"},"schema_version":"1.0"},"canonical_sha256":"7f6382a7eb6fb45526067ecfd5972839cbf3407706b36e47290b8ff59f728d83","source":{"kind":"arxiv","id":"1512.09228","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09228","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09228v2","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09228","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"P5RYFJ7LN62F","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5RYFJ7LN62FKJQG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5RYFJ7L","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P5RYFJ7LN62FKJQGP3H5LFZIHH","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-31T06:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"ebb51ce72136ae59a18e4b1cc6b6ab0e474e45462843fa021fd5ec3c8fd1e839","abstract_canon_sha256":"acfaac779ab0467d34c039b841c76e747ded3d810a041f8298e1e5980690f36e"},"schema_version":"1.0"},"canonical_sha256":"7f6382a7eb6fb45526067ecfd5972839cbf3407706b36e47290b8ff59f728d83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:24.900176Z","signature_b64":"P1ZjRUoqgyVTp9rvxtT8uzlPQJo6Xyb56PreMuWv1YWw5jrfxSQkO1WIcvv9WjeXYWzjFrkNGTYMx/rVxMw2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6382a7eb6fb45526067ecfd5972839cbf3407706b36e47290b8ff59f728d83","last_reissued_at":"2026-05-18T00:34:24.899544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:24.899544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09228","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-18T00:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KK/nSdIWmyF51zxp/XLVMM9a+Uy+zYiPfb6luCGMtS9b1TX2vuKtZgdxdg5Pz583o/ZLrAs+F6vCIVeTwJdkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:43:26.333824Z"},"content_sha256":"a665c365604ab9a1eb4ff184164b5b95ec6de37a6431dadac6afa614ef91f9cf","schema_version":"1.0","event_id":"sha256:a665c365604ab9a1eb4ff184164b5b95ec6de37a6431dadac6afa614ef91f9cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P5RYFJ7LN62FKJQGP3H5LFZIHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bernd Burgstaller, Johann Blieberger, Minyoung Jung","submitted_at":"2015-12-31T06:41:17Z","abstract_excerpt":"In this paper, we propose several optimizations for the SFA construction algorithm, which greatly reduce the in-memory footprint and the processing steps required to construct an SFA. We introduce fingerprints as a space- and time-efficient way to represent SFA states. To compute fingerprints, we apply the Barrett reduction algorithm and accelerate it using recent additions to the x86 instruction set architecture. We exploit fingerprints to introduce hashing for further optimizations. Our parallel SFA construction algorithm is nonblocking and utilizes instruction-level, data-level, and task-le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09228","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-18T00:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nrpoJWi617F95Vij5pH7z2R/ZcVcIHmuBxBU1j6QeK2NBYl5Nrw0MPfRyzIovdqJ6VihZIs8EsrilBm79LQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:43:26.334171Z"},"content_sha256":"630f503218e36d817b6e4b106b6870d679918d59d33a7e82ea74e4f130ff62cd","schema_version":"1.0","event_id":"sha256:630f503218e36d817b6e4b106b6870d679918d59d33a7e82ea74e4f130ff62cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/bundle.json","state_url":"https://pith.science/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/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:43:26Z","links":{"resolver":"https://pith.science/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH","bundle":"https://pith.science/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/bundle.json","state":"https://pith.science/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5RYFJ7LN62FKJQGP3H5LFZIHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P5RYFJ7LN62FKJQGP3H5LFZIHH","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":"acfaac779ab0467d34c039b841c76e747ded3d810a041f8298e1e5980690f36e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-31T06:41:17Z","title_canon_sha256":"ebb51ce72136ae59a18e4b1cc6b6ab0e474e45462843fa021fd5ec3c8fd1e839"},"schema_version":"1.0","source":{"id":"1512.09228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09228","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09228v2","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09228","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"P5RYFJ7LN62F","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P5RYFJ7LN62FKJQG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P5RYFJ7L","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:630f503218e36d817b6e4b106b6870d679918d59d33a7e82ea74e4f130ff62cd","target":"graph","created_at":"2026-05-18T00:34:24Z","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":"In this paper, we propose several optimizations for the SFA construction algorithm, which greatly reduce the in-memory footprint and the processing steps required to construct an SFA. We introduce fingerprints as a space- and time-efficient way to represent SFA states. To compute fingerprints, we apply the Barrett reduction algorithm and accelerate it using recent additions to the x86 instruction set architecture. We exploit fingerprints to introduce hashing for further optimizations. Our parallel SFA construction algorithm is nonblocking and utilizes instruction-level, data-level, and task-le","authors_text":"Bernd Burgstaller, Johann Blieberger, Minyoung Jung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-31T06:41:17Z","title":"Efficient Construction of Simultaneous Deterministic Finite Automata on Multicores Using Rabin Fingerprints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09228","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:a665c365604ab9a1eb4ff184164b5b95ec6de37a6431dadac6afa614ef91f9cf","target":"record","created_at":"2026-05-18T00:34:24Z","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":"acfaac779ab0467d34c039b841c76e747ded3d810a041f8298e1e5980690f36e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-31T06:41:17Z","title_canon_sha256":"ebb51ce72136ae59a18e4b1cc6b6ab0e474e45462843fa021fd5ec3c8fd1e839"},"schema_version":"1.0","source":{"id":"1512.09228","kind":"arxiv","version":2}},"canonical_sha256":"7f6382a7eb6fb45526067ecfd5972839cbf3407706b36e47290b8ff59f728d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6382a7eb6fb45526067ecfd5972839cbf3407706b36e47290b8ff59f728d83","first_computed_at":"2026-05-18T00:34:24.899544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:24.899544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1ZjRUoqgyVTp9rvxtT8uzlPQJo6Xyb56PreMuWv1YWw5jrfxSQkO1WIcvv9WjeXYWzjFrkNGTYMx/rVxMw2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:24.900176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a665c365604ab9a1eb4ff184164b5b95ec6de37a6431dadac6afa614ef91f9cf","sha256:630f503218e36d817b6e4b106b6870d679918d59d33a7e82ea74e4f130ff62cd"],"state_sha256":"5c0dcc21dc31af0dd02537585fd8d87c673dc9f0d1f01ff5f6c2b76ada31fd24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePJwTCAxYyL7h1jpcpro3cqlw6KUHpFVwQMbCbgPV2iBUm5R6OW/9wfV/nD9AKEgScxSCd2E7lV2MJB4MaZDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:43:26.336098Z","bundle_sha256":"87c318aa872b7435c50e477d62cb5191e1d8024e3f38c38270589f609e01ff2c"}}