{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DHCUGXLP75VUOGWDUINP3WGRKN","short_pith_number":"pith:DHCUGXLP","schema_version":"1.0","canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","source":{"kind":"arxiv","id":"1102.1003","version":1},"attestation_state":"computed","paper":{"title":"A New Data Layout For Set Intersection on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Rasmus Pagh, Rasmus Resen Amossen","submitted_at":"2011-02-04T19:47:41Z","abstract_excerpt":"Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can, for some computational problems, be obtained by using a graphics processing unit (GPU) as a massively parallel computing device. However, GPUs require highly regular control flow and memory access patterns, and for this reason previous GPU methods for intersecting sets have used a simple bitmap representation. This representation requires excessive space on sparse data sets. In this paper we present a novel data layout, \"BatM"},"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":"1102.1003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-04T19:47:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b671879a8e356d3dc9537f2bc0b3bf8ccacf95c538367230e05495b045aecec8","abstract_canon_sha256":"698bc1af8017045f3bf034642283108bf63683214ab701b91b10114c0024fe6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:03.272177Z","signature_b64":"30ZQudmKs/CLXUrB+Yi58SSoEKghbX7tSe/4LcIym+aLano5AJpRLtLiCcD9eBbUa6pa29Mh6CU/Jd8+YHyWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","last_reissued_at":"2026-05-18T04:30:03.271768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:03.271768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Data Layout For Set Intersection on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Rasmus Pagh, Rasmus Resen Amossen","submitted_at":"2011-02-04T19:47:41Z","abstract_excerpt":"Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can, for some computational problems, be obtained by using a graphics processing unit (GPU) as a massively parallel computing device. However, GPUs require highly regular control flow and memory access patterns, and for this reason previous GPU methods for intersecting sets have used a simple bitmap representation. This representation requires excessive space on sparse data sets. In this paper we present a novel data layout, \"BatM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1003","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":"1102.1003","created_at":"2026-05-18T04:30:03.271832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1003v1","created_at":"2026-05-18T04:30:03.271832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1003","created_at":"2026-05-18T04:30:03.271832+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHCUGXLP75VU","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHCUGXLP75VUOGWD","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHCUGXLP","created_at":"2026-05-18T12:26:26.731475+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/DHCUGXLP75VUOGWDUINP3WGRKN","json":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN.json","graph_json":"https://pith.science/api/pith-number/DHCUGXLP75VUOGWDUINP3WGRKN/graph.json","events_json":"https://pith.science/api/pith-number/DHCUGXLP75VUOGWDUINP3WGRKN/events.json","paper":"https://pith.science/paper/DHCUGXLP"},"agent_actions":{"view_html":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN","download_json":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN.json","view_paper":"https://pith.science/paper/DHCUGXLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1003&json=true","fetch_graph":"https://pith.science/api/pith-number/DHCUGXLP75VUOGWDUINP3WGRKN/graph.json","fetch_events":"https://pith.science/api/pith-number/DHCUGXLP75VUOGWDUINP3WGRKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/action/storage_attestation","attest_author":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/action/author_attestation","sign_citation":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/action/citation_signature","submit_replication":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/action/replication_record"}},"created_at":"2026-05-18T04:30:03.271832+00:00","updated_at":"2026-05-18T04:30:03.271832+00:00"}