{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBAKWNZX6KG3S24UF2KCVH44PE","short_pith_number":"pith:SBAKWNZX","canonical_record":{"source":{"id":"1803.04120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T05:28:44Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0b40d3f61b06326726fd173f6bb0fa74263bd20665b19c651c049b2db94568ad","abstract_canon_sha256":"2e644d7580532b41ac6bbbe5c659e61bdcc9be18a1e003c2a64642717d802d79"},"schema_version":"1.0"},"canonical_sha256":"9040ab3737f28db96b942e942a9f9c7911c9ff67742e1e8d699e88d3e155e76c","source":{"kind":"arxiv","id":"1803.04120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04120","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04120v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04120","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"SBAKWNZX6KG3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBAKWNZX6KG3S24U","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBAKWNZX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBAKWNZX6KG3S24UF2KCVH44PE","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T05:28:44Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0b40d3f61b06326726fd173f6bb0fa74263bd20665b19c651c049b2db94568ad","abstract_canon_sha256":"2e644d7580532b41ac6bbbe5c659e61bdcc9be18a1e003c2a64642717d802d79"},"schema_version":"1.0"},"canonical_sha256":"9040ab3737f28db96b942e942a9f9c7911c9ff67742e1e8d699e88d3e155e76c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:32.591271Z","signature_b64":"hPAMhvb8iwVhwz3aXhiWFRdM0zqnvWV0TPlUQp6K3pfzKsozmtiwUsBr1CNZ3CovxpdoWtlI/q7tdB1Wcsn/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9040ab3737f28db96b942e942a9f9c7911c9ff67742e1e8d699e88d3e155e76c","last_reissued_at":"2026-05-18T00:21:32.590612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:32.590612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04120","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:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdanXdULANeIm8FkQ6ukAxyV/NtonRVchHaiS9ktaDYoWBrvVGxCENmZBwaSRIoLl4v2LtlhMCV+U9EWZ3VtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:47:03.634800Z"},"content_sha256":"6b50d2eb76ac70645a491db99621e246bbe1155e546567d6b25491e9df26e378","schema_version":"1.0","event_id":"sha256:6b50d2eb76ac70645a491db99621e246bbe1155e546567d6b25491e9df26e378"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBAKWNZX6KG3S24UF2KCVH44PE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPU Accelerated Self-join for the Distance Similarity Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Ben Karsin, Michael Gowanlock","submitted_at":"2018-03-12T05:28:44Z","abstract_excerpt":"The self-join finds all objects in a dataset within a threshold of each other defined by a similarity metric. As such, the self-join is a building block for the field of databases and data mining, and is employed in Big Data applications. In this paper, we advance a GPU-efficient algorithm for the similarity self-join that uses the Euclidean distance metric. The search-and-refine strategy is an efficient approach for low dimensionality datasets, as index searches degrade with increasing dimension (i.e., the curse of dimensionality). Thus, we target the low dimensionality problem, and compare o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04120","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:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bGPFITkV2fG/VHTUvzHmz/s0meZ10XWDIN379UPoZKkxQ/J29vBw4Zooe9wtninBoU7EwrneUGhmgJ31Gy1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:47:03.635154Z"},"content_sha256":"59d4d0d7b34a579578a607aa0e636ddb3818a680870c8948d41b5aaa597e3936","schema_version":"1.0","event_id":"sha256:59d4d0d7b34a579578a607aa0e636ddb3818a680870c8948d41b5aaa597e3936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBAKWNZX6KG3S24UF2KCVH44PE/bundle.json","state_url":"https://pith.science/pith/SBAKWNZX6KG3S24UF2KCVH44PE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBAKWNZX6KG3S24UF2KCVH44PE/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-01T03:47:03Z","links":{"resolver":"https://pith.science/pith/SBAKWNZX6KG3S24UF2KCVH44PE","bundle":"https://pith.science/pith/SBAKWNZX6KG3S24UF2KCVH44PE/bundle.json","state":"https://pith.science/pith/SBAKWNZX6KG3S24UF2KCVH44PE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBAKWNZX6KG3S24UF2KCVH44PE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBAKWNZX6KG3S24UF2KCVH44PE","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":"2e644d7580532b41ac6bbbe5c659e61bdcc9be18a1e003c2a64642717d802d79","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T05:28:44Z","title_canon_sha256":"0b40d3f61b06326726fd173f6bb0fa74263bd20665b19c651c049b2db94568ad"},"schema_version":"1.0","source":{"id":"1803.04120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04120","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04120v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04120","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"SBAKWNZX6KG3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBAKWNZX6KG3S24U","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBAKWNZX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:59d4d0d7b34a579578a607aa0e636ddb3818a680870c8948d41b5aaa597e3936","target":"graph","created_at":"2026-05-18T00:21:32Z","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 within a threshold of each other defined by a similarity metric. As such, the self-join is a building block for the field of databases and data mining, and is employed in Big Data applications. In this paper, we advance a GPU-efficient algorithm for the similarity self-join that uses the Euclidean distance metric. The search-and-refine strategy is an efficient approach for low dimensionality datasets, as index searches degrade with increasing dimension (i.e., the curse of dimensionality). Thus, we target the low dimensionality problem, and compare o","authors_text":"Ben Karsin, Michael Gowanlock","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T05:28:44Z","title":"GPU Accelerated Self-join for the Distance Similarity Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04120","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:6b50d2eb76ac70645a491db99621e246bbe1155e546567d6b25491e9df26e378","target":"record","created_at":"2026-05-18T00:21:32Z","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":"2e644d7580532b41ac6bbbe5c659e61bdcc9be18a1e003c2a64642717d802d79","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T05:28:44Z","title_canon_sha256":"0b40d3f61b06326726fd173f6bb0fa74263bd20665b19c651c049b2db94568ad"},"schema_version":"1.0","source":{"id":"1803.04120","kind":"arxiv","version":1}},"canonical_sha256":"9040ab3737f28db96b942e942a9f9c7911c9ff67742e1e8d699e88d3e155e76c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9040ab3737f28db96b942e942a9f9c7911c9ff67742e1e8d699e88d3e155e76c","first_computed_at":"2026-05-18T00:21:32.590612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:32.590612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hPAMhvb8iwVhwz3aXhiWFRdM0zqnvWV0TPlUQp6K3pfzKsozmtiwUsBr1CNZ3CovxpdoWtlI/q7tdB1Wcsn/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:32.591271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b50d2eb76ac70645a491db99621e246bbe1155e546567d6b25491e9df26e378","sha256:59d4d0d7b34a579578a607aa0e636ddb3818a680870c8948d41b5aaa597e3936"],"state_sha256":"516bcf52dfc2d4298332160904568a90deb84924e106fa4d2ffcce8b343a4dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7f83lEv1F/npHXpxnYyANXTP2ysUsAtsa/SaVl3KPYsh2nKBrhe8cACOJHs+doJQRQW5ZW7qGdf7T/KS3MrGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:47:03.637337Z","bundle_sha256":"c4d0cd2cfe244730f6fa39ac63f89cc2ebfc6ae11063c532e9e097ed6627a820"}}