{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CSGMQY34VWACCCTQWFZSCTWN7S","short_pith_number":"pith:CSGMQY34","schema_version":"1.0","canonical_sha256":"148cc8637cad80210a70b173214ecdfc90dc46dbff921a98f8e750da8448e752","source":{"kind":"arxiv","id":"1702.03657","version":1},"attestation_state":"computed","paper":{"title":"Trie Compression for GPU Accelerated Multi-Pattern Matching","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amar Seeam, Christos Tachtatzis, Robert Atkinson, Xavier Bellekens","submitted_at":"2017-02-13T07:18:13Z","abstract_excerpt":"Graphics Processing Units allow for running massively parallel applications offloading the CPU from computationally intensive resources, however GPUs have a limited amount of memory. In this paper a trie compression algorithm for massively parallel pattern matching is presented demonstrating 85% less space requirements than the original highly efficient parallel failure-less aho-corasick, whilst demonstrating over 22 Gbps throughput. The algorithm presented takes advantage of compressed row storage matrices as well as shared and texture memory on the GPU."},"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":"1702.03657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T07:18:13Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c53d575182251320290957a4fc0600ebf22cdfbdfe14f51d3aa5cbee1b88b3ad","abstract_canon_sha256":"95530859f6243d1c8a712b4324daa71deaaab1fd9edae6d50240a47f046b8ce0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.989061Z","signature_b64":"9OebDfcQwvlNfSedKkaGNa9qH/a0Dxf7JS006L6xN7fG06pcPObTS0rJZ//o/fa6Vb9nkjMBFtIKTKPoNvfiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148cc8637cad80210a70b173214ecdfc90dc46dbff921a98f8e750da8448e752","last_reissued_at":"2026-05-18T00:50:34.988200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.988200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trie Compression for GPU Accelerated Multi-Pattern Matching","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amar Seeam, Christos Tachtatzis, Robert Atkinson, Xavier Bellekens","submitted_at":"2017-02-13T07:18:13Z","abstract_excerpt":"Graphics Processing Units allow for running massively parallel applications offloading the CPU from computationally intensive resources, however GPUs have a limited amount of memory. In this paper a trie compression algorithm for massively parallel pattern matching is presented demonstrating 85% less space requirements than the original highly efficient parallel failure-less aho-corasick, whilst demonstrating over 22 Gbps throughput. The algorithm presented takes advantage of compressed row storage matrices as well as shared and texture memory on the GPU."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03657","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03657","created_at":"2026-05-18T00:50:34.988330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03657v1","created_at":"2026-05-18T00:50:34.988330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03657","created_at":"2026-05-18T00:50:34.988330+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSGMQY34VWAC","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSGMQY34VWACCCTQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSGMQY34","created_at":"2026-05-18T12:31:10.602751+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/CSGMQY34VWACCCTQWFZSCTWN7S","json":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S.json","graph_json":"https://pith.science/api/pith-number/CSGMQY34VWACCCTQWFZSCTWN7S/graph.json","events_json":"https://pith.science/api/pith-number/CSGMQY34VWACCCTQWFZSCTWN7S/events.json","paper":"https://pith.science/paper/CSGMQY34"},"agent_actions":{"view_html":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S","download_json":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S.json","view_paper":"https://pith.science/paper/CSGMQY34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03657&json=true","fetch_graph":"https://pith.science/api/pith-number/CSGMQY34VWACCCTQWFZSCTWN7S/graph.json","fetch_events":"https://pith.science/api/pith-number/CSGMQY34VWACCCTQWFZSCTWN7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S/action/storage_attestation","attest_author":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S/action/author_attestation","sign_citation":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S/action/citation_signature","submit_replication":"https://pith.science/pith/CSGMQY34VWACCCTQWFZSCTWN7S/action/replication_record"}},"created_at":"2026-05-18T00:50:34.988330+00:00","updated_at":"2026-05-18T00:50:34.988330+00:00"}