{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QFQPDIQORJA65W5MM7KMARKXZC","short_pith_number":"pith:QFQPDIQO","schema_version":"1.0","canonical_sha256":"8160f1a20e8a41eedbac67d4c04557c88ac12b83e198e207150a0c3fb938ffe5","source":{"kind":"arxiv","id":"1709.01190","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01190","created_at":"2026-05-18T00:11:50.608616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01190v2","created_at":"2026-05-18T00:11:50.608616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01190","created_at":"2026-05-18T00:11:50.608616+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFQPDIQORJA6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFQPDIQORJA65W5M","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFQPDIQO","created_at":"2026-05-18T12:31:37.085036+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/QFQPDIQORJA65W5MM7KMARKXZC","json":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC.json","graph_json":"https://pith.science/api/pith-number/QFQPDIQORJA65W5MM7KMARKXZC/graph.json","events_json":"https://pith.science/api/pith-number/QFQPDIQORJA65W5MM7KMARKXZC/events.json","paper":"https://pith.science/paper/QFQPDIQO"},"agent_actions":{"view_html":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC","download_json":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC.json","view_paper":"https://pith.science/paper/QFQPDIQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01190&json=true","fetch_graph":"https://pith.science/api/pith-number/QFQPDIQORJA65W5MM7KMARKXZC/graph.json","fetch_events":"https://pith.science/api/pith-number/QFQPDIQORJA65W5MM7KMARKXZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/action/storage_attestation","attest_author":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/action/author_attestation","sign_citation":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/action/citation_signature","submit_replication":"https://pith.science/pith/QFQPDIQORJA65W5MM7KMARKXZC/action/replication_record"}},"created_at":"2026-05-18T00:11:50.608616+00:00","updated_at":"2026-05-18T00:11:50.608616+00:00"}