{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FHMN7PUMRJXEWEYBS34SEIZXDH","short_pith_number":"pith:FHMN7PUM","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"},"canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","source":{"kind":"arxiv","id":"1809.09930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09930","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09930v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09930","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"FHMN7PUMRJXE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHMN7PUMRJXEWEYB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHMN7PUM","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FHMN7PUMRJXEWEYBS34SEIZXDH","target":"record","payload":{"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"},"canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","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"},"source_kind":"arxiv","source_id":"1809.09930","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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmE9KgW5MVc0T4zd7ara1v/uW9BTRsBEEQxJUpvtToX1Y8hzZq56DuVsxmmZM6Nzu0AlJqXv6GpezEP4poKeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:47:52.434009Z"},"content_sha256":"0b232f055d54d0f92f7d2ee160eaa353cb1599b631982eccc3dbe194181e56b1","schema_version":"1.0","event_id":"sha256:0b232f055d54d0f92f7d2ee160eaa353cb1599b631982eccc3dbe194181e56b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FHMN7PUMRJXEWEYBS34SEIZXDH","target":"graph","payload":{"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"},"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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQIqbzYjTtsNBSdkPuG0ZTb/S5cWaYP5JMA9Aj5BfrxXNMJdgYnXZi8vuaCvt3TPctfsADa2PpV9xo/oZK9BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:47:52.434372Z"},"content_sha256":"fac203631316c4d8b70f448a6ad68beb91ec2085b338461c0cac3e92e10d9272","schema_version":"1.0","event_id":"sha256:fac203631316c4d8b70f448a6ad68beb91ec2085b338461c0cac3e92e10d9272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/bundle.json","state_url":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/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-01T07:47:52Z","links":{"resolver":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH","bundle":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/bundle.json","state":"https://pith.science/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHMN7PUMRJXEWEYBS34SEIZXDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FHMN7PUMRJXEWEYBS34SEIZXDH","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":"54ae60a4f576ab3bcd6697e8845c00c2acdb9ef683698f6acdc7315930ee325d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-26T12:04:51Z","title_canon_sha256":"c4457023d25d7f829c2ae3ff11ed0c51f5ec08b6a6467e14724db88f749ccebd"},"schema_version":"1.0","source":{"id":"1809.09930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09930","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09930v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09930","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"FHMN7PUMRJXE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHMN7PUMRJXEWEYB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHMN7PUM","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:fac203631316c4d8b70f448a6ad68beb91ec2085b338461c0cac3e92e10d9272","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"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","authors_text":"Ben Karsin, Michael Gowanlock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-26T12:04:51Z","title":"GPU Accelerated Similarity Self-Join for Multi-Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09930","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:0b232f055d54d0f92f7d2ee160eaa353cb1599b631982eccc3dbe194181e56b1","target":"record","created_at":"2026-05-18T00:04:43Z","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":"54ae60a4f576ab3bcd6697e8845c00c2acdb9ef683698f6acdc7315930ee325d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-26T12:04:51Z","title_canon_sha256":"c4457023d25d7f829c2ae3ff11ed0c51f5ec08b6a6467e14724db88f749ccebd"},"schema_version":"1.0","source":{"id":"1809.09930","kind":"arxiv","version":1}},"canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d8dfbe8c8a6e4b130196f922233719f44e77ab8d66f83e7d0b422b0dd96329","first_computed_at":"2026-05-18T00:04:43.241614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.241614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4yNVUrGSTSi6GU4BtjdnLtICSvUtWmmKB+wQbjs/fTth2La+n3EetDvzH/ObHykoKpmfUDNDBJ+WziOKGdywDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.242296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b232f055d54d0f92f7d2ee160eaa353cb1599b631982eccc3dbe194181e56b1","sha256:fac203631316c4d8b70f448a6ad68beb91ec2085b338461c0cac3e92e10d9272"],"state_sha256":"c0dc6c94b7143468f24ef825bb34431263c31c2d55dc7c9d9f21d451104b7168"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4QsqAsO/fxUNVzxJETRIFu6Ui1TTlaPjiLReZViXk1y+zOBsh3c7JFIHbQUz+tVQLpj4fA5tE6NjyV7XV7RBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:47:52.436214Z","bundle_sha256":"5ee1dba7f2588a0426278010d96dda043c52e3cdf595dd3baba1d6c71f9c8437"}}