{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QFQPDIQORJA65W5MM7KMARKXZC","short_pith_number":"pith:QFQPDIQO","canonical_record":{"source":{"id":"1709.01190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T23:09:19Z","cross_cats_sorted":["cs.DB","cs.DC","cs.IR","cs.PF"],"title_canon_sha256":"6ceede14c11f0d8e173886510f0570eb51b092c5d6801f0f115ae2f0f59b0d71","abstract_canon_sha256":"686bf99e67e0149174faf50b831ceb1afe3376390093ac7819e1b6bca5ef7fcb"},"schema_version":"1.0"},"canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","source":{"kind":"arxiv","id":"1709.01190","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01190","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01190v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01190","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"QFQPDIQORJA6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFQPDIQORJA65W5M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFQPDIQO","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QFQPDIQORJA65W5MM7KMARKXZC","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T23:09:19Z","cross_cats_sorted":["cs.DB","cs.DC","cs.IR","cs.PF"],"title_canon_sha256":"6ceede14c11f0d8e173886510f0570eb51b092c5d6801f0f115ae2f0f59b0d71","abstract_canon_sha256":"686bf99e67e0149174faf50b831ceb1afe3376390093ac7819e1b6bca5ef7fcb"},"schema_version":"1.0"},"canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:50.609182Z","signature_b64":"sAeuxJhaTUuLoOCgyfNu63kguh0k/xQTV5vwpjsxEbmJUhTxwDU5X5w/vf3wQKzuyF6Aqna+DVRkvQWjJ8ozCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","last_reissued_at":"2026-05-18T00:11:50.608503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:50.608503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01190","source_version":2,"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIadAt+pkt0YFwQKhZ1QG6ke0y854/ZM1uvwYbR6q5UVPDGjWDKh4MHxxUSi047POGYOr9jKcqfjMC0V2Y8pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:52:26.918982Z"},"content_sha256":"d801be7865713b8217f7b3506aab761f06b16abceabd2b413f808991e968471b","schema_version":"1.0","event_id":"sha256:d801be7865713b8217f7b3506aab761f06b16abceabd2b413f808991e968471b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QFQPDIQORJA65W5MM7KMARKXZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.IR","cs.PF"],"primary_cat":"cs.DS","authors_text":"Anshumali Shrivastava, Jonathan Wang, Junghee Ryu, Yiqiu Wang","submitted_at":"2017-09-04T23:09:19Z","abstract_excerpt":"We present FLASH (\\textbf{F}ast \\textbf{L}SH \\textbf{A}lgorithm for \\textbf{S}imilarity search accelerated with \\textbf{H}PC), a similarity search system for ultra-high dimensional datasets on a single machine, that does not require similarity computations and is tailored for high-performance computing platforms. By leveraging a LSH style randomized indexing procedure and combining it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations, we reduce the computational and parallelization costs of similarity search"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01190","kind":"arxiv","version":2},"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:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0qflxJFzLNJbYE3W2L85VBy6G6t6cEQM7TZFmhQLMUSGQJMw8FNLKG5EG+7RWATmBifPF6+SNP77r+HY5hiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:52:26.919654Z"},"content_sha256":"b0a0acc834d35470602553f7ab9bad2d35a1a09362a3d0766c17c906cc15fa40","schema_version":"1.0","event_id":"sha256:b0a0acc834d35470602553f7ab9bad2d35a1a09362a3d0766c17c906cc15fa40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/bundle.json","state_url":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFQPDIQORJA65W5MM7KMARKXZC/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-05-26T03:52:26Z","links":{"resolver":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC","bundle":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/bundle.json","state":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFQPDIQORJA65W5MM7KMARKXZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QFQPDIQORJA65W5MM7KMARKXZC","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":"686bf99e67e0149174faf50b831ceb1afe3376390093ac7819e1b6bca5ef7fcb","cross_cats_sorted":["cs.DB","cs.DC","cs.IR","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T23:09:19Z","title_canon_sha256":"6ceede14c11f0d8e173886510f0570eb51b092c5d6801f0f115ae2f0f59b0d71"},"schema_version":"1.0","source":{"id":"1709.01190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01190","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01190v2","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01190","created_at":"2026-05-18T00:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"QFQPDIQORJA6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFQPDIQORJA65W5M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFQPDIQO","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:b0a0acc834d35470602553f7ab9bad2d35a1a09362a3d0766c17c906cc15fa40","target":"graph","created_at":"2026-05-18T00:11:50Z","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":"We present FLASH (\\textbf{F}ast \\textbf{L}SH \\textbf{A}lgorithm for \\textbf{S}imilarity search accelerated with \\textbf{H}PC), a similarity search system for ultra-high dimensional datasets on a single machine, that does not require similarity computations and is tailored for high-performance computing platforms. By leveraging a LSH style randomized indexing procedure and combining it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations, we reduce the computational and parallelization costs of similarity search","authors_text":"Anshumali Shrivastava, Jonathan Wang, Junghee Ryu, Yiqiu Wang","cross_cats":["cs.DB","cs.DC","cs.IR","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T23:09:19Z","title":"FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01190","kind":"arxiv","version":2},"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:d801be7865713b8217f7b3506aab761f06b16abceabd2b413f808991e968471b","target":"record","created_at":"2026-05-18T00:11:50Z","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":"686bf99e67e0149174faf50b831ceb1afe3376390093ac7819e1b6bca5ef7fcb","cross_cats_sorted":["cs.DB","cs.DC","cs.IR","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-04T23:09:19Z","title_canon_sha256":"6ceede14c11f0d8e173886510f0570eb51b092c5d6801f0f115ae2f0f59b0d71"},"schema_version":"1.0","source":{"id":"1709.01190","kind":"arxiv","version":2}},"canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","first_computed_at":"2026-05-18T00:11:50.608503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:50.608503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAeuxJhaTUuLoOCgyfNu63kguh0k/xQTV5vwpjsxEbmJUhTxwDU5X5w/vf3wQKzuyF6Aqna+DVRkvQWjJ8ozCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:50.609182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d801be7865713b8217f7b3506aab761f06b16abceabd2b413f808991e968471b","sha256:b0a0acc834d35470602553f7ab9bad2d35a1a09362a3d0766c17c906cc15fa40"],"state_sha256":"f37dc4a6ab55e40161d1d572747708566d62219dba9b9deba39fc4141ffb4557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hhd7UPzLOr7qxdThE2IUUcyTgUpq4b60aIfb7QZ2ocV5VoOq38Wee9p8HkSZeLJyt5sl8+7jjbC6wzYlVZZjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:52:26.922980Z","bundle_sha256":"71251cfd558234aba93bdf3d1cfacc577ad08f7ff7ad00140b8421a04ae1b79f"}}