{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZEPXHAMSA5U47RQ6DPDHOI2CCE","short_pith_number":"pith:ZEPXHAMS","schema_version":"1.0","canonical_sha256":"c91f7381920769cfc61e1bc6772342113ef73b354e0cadca8f2dd9932058e372","source":{"kind":"arxiv","id":"1710.11246","version":2},"attestation_state":"computed","paper":{"title":"A Dynamic Hash Table for the GPU","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"John D. Owens, Martin Farach-Colton, Saman Ashkiani","submitted_at":"2017-10-30T21:20:39Z","abstract_excerpt":"We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing strategy that reduces branch divergence and provides an efficient alternative to the traditional way of per-thread (or per-warp) work assignment and processing. By using this strategy, we build a dynamic non-blocking concurrent linked list, the slab list, that supports asynchronous, concurrent updates (insertions and deletions) as well as search queries. We use the slab list to implement a dynamic hash table wi"},"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":"1710.11246","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-10-30T21:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"3a907aae9e63d73e5f24a926000c35a0fef3596df0c98096fef8ac4d7cb0f602","abstract_canon_sha256":"3be59f4ec67e399324c27332aa8bc44d551107f8bf323b9d8add823915837c6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.597739Z","signature_b64":"cMQesz63Z+Fs7F3MoeKvdaRrCw8CfKySpZrni8VtWcPl/f+0myQQZhF/S4KhJTsUNlwz0PCgyeDkjwPJdRe6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c91f7381920769cfc61e1bc6772342113ef73b354e0cadca8f2dd9932058e372","last_reissued_at":"2026-05-18T00:22:10.597124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.597124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Hash Table for the GPU","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"John D. Owens, Martin Farach-Colton, Saman Ashkiani","submitted_at":"2017-10-30T21:20:39Z","abstract_excerpt":"We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing strategy that reduces branch divergence and provides an efficient alternative to the traditional way of per-thread (or per-warp) work assignment and processing. By using this strategy, we build a dynamic non-blocking concurrent linked list, the slab list, that supports asynchronous, concurrent updates (insertions and deletions) as well as search queries. We use the slab list to implement a dynamic hash table wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11246","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":"1710.11246","created_at":"2026-05-18T00:22:10.597193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11246v2","created_at":"2026-05-18T00:22:10.597193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11246","created_at":"2026-05-18T00:22:10.597193+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEPXHAMSA5U4","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEPXHAMSA5U47RQ6","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEPXHAMS","created_at":"2026-05-18T12:31:59.375834+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/ZEPXHAMSA5U47RQ6DPDHOI2CCE","json":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE.json","graph_json":"https://pith.science/api/pith-number/ZEPXHAMSA5U47RQ6DPDHOI2CCE/graph.json","events_json":"https://pith.science/api/pith-number/ZEPXHAMSA5U47RQ6DPDHOI2CCE/events.json","paper":"https://pith.science/paper/ZEPXHAMS"},"agent_actions":{"view_html":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE","download_json":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE.json","view_paper":"https://pith.science/paper/ZEPXHAMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11246&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEPXHAMSA5U47RQ6DPDHOI2CCE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEPXHAMSA5U47RQ6DPDHOI2CCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE/action/storage_attestation","attest_author":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE/action/author_attestation","sign_citation":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE/action/citation_signature","submit_replication":"https://pith.science/pith/ZEPXHAMSA5U47RQ6DPDHOI2CCE/action/replication_record"}},"created_at":"2026-05-18T00:22:10.597193+00:00","updated_at":"2026-05-18T00:22:10.597193+00:00"}