{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FHMN7PUMRJXEWEYBS34SEIZXDH","short_pith_number":"pith:FHMN7PUM","schema_version":"1.0","canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","source":{"kind":"arxiv","id":"1809.09930","version":1},"attestation_state":"computed","paper":{"title":"GPU Accelerated Similarity Self-Join for Multi-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ben Karsin, Michael Gowanlock","submitted_at":"2018-09-26T12:04:51Z","abstract_excerpt":"The self-join finds all objects in a dataset that are within a search distance, epsilon, of each other; therefore, the self-join is a building block of many algorithms. We advance a GPU-accelerated self-join algorithm targeted towards high dimensional data. The massive parallelism afforded by the GPU and high aggregate memory bandwidth makes the architecture well-suited for data-intensive workloads. We leverage a grid-based, GPU-tailored index to perform range queries. We propose the following optimizations: (i) a trade-off between candidate set filtering and index search overhead by exploitin"},"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":"1809.09930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-26T12:04:51Z","cross_cats_sorted":[],"title_canon_sha256":"c4457023d25d7f829c2ae3ff11ed0c51f5ec08b6a6467e14724db88f749ccebd","abstract_canon_sha256":"54ae60a4f576ab3bcd6697e8845c00c2acdb9ef683698f6acdc7315930ee325d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.242296Z","signature_b64":"4yNVUrGSTSi6GU4BtjdnLtICSvUtWmmKB+wQbjs/fTth2La+n3EetDvzH/ObHykoKpmfUDNDBJ+WziOKGdywDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","last_reissued_at":"2026-05-18T00:04:43.241614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.241614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU Accelerated Similarity Self-Join for Multi-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ben Karsin, Michael Gowanlock","submitted_at":"2018-09-26T12:04:51Z","abstract_excerpt":"The self-join finds all objects in a dataset that are within a search distance, epsilon, of each other; therefore, the self-join is a building block of many algorithms. We advance a GPU-accelerated self-join algorithm targeted towards high dimensional data. The massive parallelism afforded by the GPU and high aggregate memory bandwidth makes the architecture well-suited for data-intensive workloads. We leverage a grid-based, GPU-tailored index to perform range queries. We propose the following optimizations: (i) a trade-off between candidate set filtering and index search overhead by exploitin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09930","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":"1809.09930","created_at":"2026-05-18T00:04:43.241718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09930v1","created_at":"2026-05-18T00:04:43.241718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09930","created_at":"2026-05-18T00:04:43.241718+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHMN7PUMRJXE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHMN7PUMRJXEWEYB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHMN7PUM","created_at":"2026-05-18T12:32:22.470017+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/FHMN7PUMRJXEWEYBS34SEIZXDH","json":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH.json","graph_json":"https://pith.science/api/pith-number/FHMN7PUMRJXEWEYBS34SEIZXDH/graph.json","events_json":"https://pith.science/api/pith-number/FHMN7PUMRJXEWEYBS34SEIZXDH/events.json","paper":"https://pith.science/paper/FHMN7PUM"},"agent_actions":{"view_html":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH","download_json":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH.json","view_paper":"https://pith.science/paper/FHMN7PUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09930&json=true","fetch_graph":"https://pith.science/api/pith-number/FHMN7PUMRJXEWEYBS34SEIZXDH/graph.json","fetch_events":"https://pith.science/api/pith-number/FHMN7PUMRJXEWEYBS34SEIZXDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/action/storage_attestation","attest_author":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/action/author_attestation","sign_citation":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/action/citation_signature","submit_replication":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/action/replication_record"}},"created_at":"2026-05-18T00:04:43.241718+00:00","updated_at":"2026-05-18T00:04:43.241718+00:00"}