{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7HAC6HFOC3HJM5AGFUBB7UGBVR","short_pith_number":"pith:7HAC6HFO","canonical_record":{"source":{"id":"1811.10498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-26T16:45:30Z","cross_cats_sorted":["cs.DS","cs.PF"],"title_canon_sha256":"10bec8fa744bc55ca3476140bc89ff556950c4800aeb77c7032d11e089d7add6","abstract_canon_sha256":"c8d29977ea0c2e45227b74d494243a887a6f0d081752017f23cd37fd3193e5f3"},"schema_version":"1.0"},"canonical_sha256":"f9c02f1cae16ce9674062d021fd0c1ac5ecc8ea3262c0963fdece3889e7c04fb","source":{"kind":"arxiv","id":"1811.10498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10498","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10498v1","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10498","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"7HAC6HFOC3HJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7HAC6HFOC3HJM5AG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7HAC6HFO","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7HAC6HFOC3HJM5AGFUBB7UGBVR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-26T16:45:30Z","cross_cats_sorted":["cs.DS","cs.PF"],"title_canon_sha256":"10bec8fa744bc55ca3476140bc89ff556950c4800aeb77c7032d11e089d7add6","abstract_canon_sha256":"c8d29977ea0c2e45227b74d494243a887a6f0d081752017f23cd37fd3193e5f3"},"schema_version":"1.0"},"canonical_sha256":"f9c02f1cae16ce9674062d021fd0c1ac5ecc8ea3262c0963fdece3889e7c04fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:54.552443Z","signature_b64":"CXbmoQkKjbimx8JF+Z8t7uoprZ0WYQsjagu+wvxHnxiYKLsFVDmC91Y7qwYGOX6LsEUIZNFn/Vnq+IeWgbeNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9c02f1cae16ce9674062d021fd0c1ac5ecc8ea3262c0963fdece3889e7c04fb","last_reissued_at":"2026-05-17T23:59:54.551864Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:54.551864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10498","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-17T23:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZY5ZAcb4BRJekuuKl8RWPwZ6Ls555o2fD99ctaqlz2ST9XrzdfXsMM8G9QHaMOpGKE29hNIvy/AufepJ7ZEUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:14:03.589719Z"},"content_sha256":"91442b0ee8071ab1f90cd28e4f3b3a9edebd9499b67b896f051334e829e00c63","schema_version":"1.0","event_id":"sha256:91442b0ee8071ab1f90cd28e4f3b3a9edebd9499b67b896f051334e829e00c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7HAC6HFOC3HJM5AGFUBB7UGBVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimized Parallel Failure-less Aho-Corasick algorithm for DNA sequence matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Dhammike Elkaduwe, Roshan G. Ragel, Vajira Thambawita","submitted_at":"2018-11-26T16:45:30Z","abstract_excerpt":"The Aho-Corasick algorithm is multiple patterns searching algorithm running sequentially in various applications like network intrusion detection and bioinformatics for finding several input strings within a given large input string. The parallel version of the Aho-Corasick algorithm is called as Parallel Failure-less Aho-Corasick algorithm because it doesn't need failure links like in the original Aho-Corasick algorithm. In this research, we implemented an application specific parallel failureless Aho-Corasick algorithm to the general purpose graphics processing unit by applying several cache"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10498","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-17T23:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmBn98HbPmSAZrpl1VAg66GvpTyv/erZ6lRyJwP+bZn12PpzRf0H0vuAtCSVmmwhUjEzLrsd1ey3dk1iuMUXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:14:03.590186Z"},"content_sha256":"5b204108a08bf7b46cdbb17272f2c0564e9d725b705062e14d0400f27aa2bf9e","schema_version":"1.0","event_id":"sha256:5b204108a08bf7b46cdbb17272f2c0564e9d725b705062e14d0400f27aa2bf9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/bundle.json","state_url":"https://pith.science/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/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-05-31T02:14:03Z","links":{"resolver":"https://pith.science/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR","bundle":"https://pith.science/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/bundle.json","state":"https://pith.science/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HAC6HFOC3HJM5AGFUBB7UGBVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7HAC6HFOC3HJM5AGFUBB7UGBVR","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":"c8d29977ea0c2e45227b74d494243a887a6f0d081752017f23cd37fd3193e5f3","cross_cats_sorted":["cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-26T16:45:30Z","title_canon_sha256":"10bec8fa744bc55ca3476140bc89ff556950c4800aeb77c7032d11e089d7add6"},"schema_version":"1.0","source":{"id":"1811.10498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10498","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10498v1","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10498","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"7HAC6HFOC3HJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7HAC6HFOC3HJM5AG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7HAC6HFO","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5b204108a08bf7b46cdbb17272f2c0564e9d725b705062e14d0400f27aa2bf9e","target":"graph","created_at":"2026-05-17T23:59:54Z","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 Aho-Corasick algorithm is multiple patterns searching algorithm running sequentially in various applications like network intrusion detection and bioinformatics for finding several input strings within a given large input string. The parallel version of the Aho-Corasick algorithm is called as Parallel Failure-less Aho-Corasick algorithm because it doesn't need failure links like in the original Aho-Corasick algorithm. In this research, we implemented an application specific parallel failureless Aho-Corasick algorithm to the general purpose graphics processing unit by applying several cache","authors_text":"Dhammike Elkaduwe, Roshan G. Ragel, Vajira Thambawita","cross_cats":["cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-26T16:45:30Z","title":"An optimized Parallel Failure-less Aho-Corasick algorithm for DNA sequence matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10498","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:91442b0ee8071ab1f90cd28e4f3b3a9edebd9499b67b896f051334e829e00c63","target":"record","created_at":"2026-05-17T23:59:54Z","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":"c8d29977ea0c2e45227b74d494243a887a6f0d081752017f23cd37fd3193e5f3","cross_cats_sorted":["cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-26T16:45:30Z","title_canon_sha256":"10bec8fa744bc55ca3476140bc89ff556950c4800aeb77c7032d11e089d7add6"},"schema_version":"1.0","source":{"id":"1811.10498","kind":"arxiv","version":1}},"canonical_sha256":"f9c02f1cae16ce9674062d021fd0c1ac5ecc8ea3262c0963fdece3889e7c04fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9c02f1cae16ce9674062d021fd0c1ac5ecc8ea3262c0963fdece3889e7c04fb","first_computed_at":"2026-05-17T23:59:54.551864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:54.551864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CXbmoQkKjbimx8JF+Z8t7uoprZ0WYQsjagu+wvxHnxiYKLsFVDmC91Y7qwYGOX6LsEUIZNFn/Vnq+IeWgbeNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:54.552443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91442b0ee8071ab1f90cd28e4f3b3a9edebd9499b67b896f051334e829e00c63","sha256:5b204108a08bf7b46cdbb17272f2c0564e9d725b705062e14d0400f27aa2bf9e"],"state_sha256":"392cf0576a083aae3a1c08543a4e6db8744be600fc599c76c80fa99e5c986191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EF9wf4uQLuBXG+vmA4rDsIPKwngCw4VyPrfm16n0KsXxVdMnfj6Tj/j3WRpbYOaCC/uK65/5a7zS8dtCMFZ6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:14:03.592173Z","bundle_sha256":"591f5c3e74b3336126fe3cb407cb40a8fefc13348d59f0951beb22bf2f33ca04"}}