{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DHCUGXLP75VUOGWDUINP3WGRKN","short_pith_number":"pith:DHCUGXLP","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"},"canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","source":{"kind":"arxiv","id":"1102.1003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1003","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1003v1","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1003","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"DHCUGXLP75VU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DHCUGXLP75VUOGWD","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DHCUGXLP","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DHCUGXLP75VUOGWDUINP3WGRKN","target":"record","payload":{"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"},"canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","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"},"source_kind":"arxiv","source_id":"1102.1003","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-18T04:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkTuT0VMtVRTNNIDtdLMixuuHeZA3/sYOOlFhROSbGoKfLBOe7MRmKLIzXhaTcAq0iIUn5RsAc37ND9QVfKQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:05.859653Z"},"content_sha256":"3d80fc79dd0ae9a6db26cce0829e8168487ebfdbeca8c6ff541cf8eb64141996","schema_version":"1.0","event_id":"sha256:3d80fc79dd0ae9a6db26cce0829e8168487ebfdbeca8c6ff541cf8eb64141996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DHCUGXLP75VUOGWDUINP3WGRKN","target":"graph","payload":{"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"},"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-18T04:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwMYJZtxwSAkTVRyNFb6GPd5POBElFQ4aPdhmx4mA22JFWNiHU3OBLrXI9qYsCNYeirjrDiznlPENCNN4T8YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:05.860253Z"},"content_sha256":"4a9d1a6504d50f0343046c1827d743a6a62688b95005cbc54b89762380672e2d","schema_version":"1.0","event_id":"sha256:4a9d1a6504d50f0343046c1827d743a6a62688b95005cbc54b89762380672e2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/bundle.json","state_url":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHCUGXLP75VUOGWDUINP3WGRKN/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-06T14:44:05Z","links":{"resolver":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN","bundle":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/bundle.json","state":"https://pith.science/pith/DHCUGXLP75VUOGWDUINP3WGRKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHCUGXLP75VUOGWDUINP3WGRKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DHCUGXLP75VUOGWDUINP3WGRKN","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":"698bc1af8017045f3bf034642283108bf63683214ab701b91b10114c0024fe6a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-04T19:47:41Z","title_canon_sha256":"b671879a8e356d3dc9537f2bc0b3bf8ccacf95c538367230e05495b045aecec8"},"schema_version":"1.0","source":{"id":"1102.1003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1003","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1003v1","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1003","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"DHCUGXLP75VU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DHCUGXLP75VUOGWD","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DHCUGXLP","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:4a9d1a6504d50f0343046c1827d743a6a62688b95005cbc54b89762380672e2d","target":"graph","created_at":"2026-05-18T04:30:03Z","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":"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","authors_text":"Rasmus Pagh, Rasmus Resen Amossen","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-04T19:47:41Z","title":"A New Data Layout For Set Intersection on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1003","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:3d80fc79dd0ae9a6db26cce0829e8168487ebfdbeca8c6ff541cf8eb64141996","target":"record","created_at":"2026-05-18T04:30:03Z","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":"698bc1af8017045f3bf034642283108bf63683214ab701b91b10114c0024fe6a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-04T19:47:41Z","title_canon_sha256":"b671879a8e356d3dc9537f2bc0b3bf8ccacf95c538367230e05495b045aecec8"},"schema_version":"1.0","source":{"id":"1102.1003","kind":"arxiv","version":1}},"canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19c5435d6fff6b471ac3a21afdd8d1535971710971b0ad45dfda8a799d275535","first_computed_at":"2026-05-18T04:30:03.271768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:03.271768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30ZQudmKs/CLXUrB+Yi58SSoEKghbX7tSe/4LcIym+aLano5AJpRLtLiCcD9eBbUa6pa29Mh6CU/Jd8+YHyWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:03.272177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d80fc79dd0ae9a6db26cce0829e8168487ebfdbeca8c6ff541cf8eb64141996","sha256:4a9d1a6504d50f0343046c1827d743a6a62688b95005cbc54b89762380672e2d"],"state_sha256":"16b835a54a173093424dedb53fcafc605022ababfb3496bbede4992886971272"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nqhw24JMrt7vtklr+hstwR9NKHuP0KIiaHnp3aGE2PbuUfPlsBdJnvlB6/Fj1VgR6z2UkVimAzbaAuZE/+EDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:44:05.863034Z","bundle_sha256":"676d19603a01a3984a068ea56a62a3840b09e4261c38842923a5bdb49cbdcfe2"}}