{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QR5AVGQYKNCTA77HO56GDYRNYC","short_pith_number":"pith:QR5AVGQY","canonical_record":{"source":{"id":"2102.08942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-17T18:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"372547727853b4c0b91c533bc471e5dfaa449455bf73678af25a72ef05657cfd","abstract_canon_sha256":"52448e4e225323aa1a4aadb8d5aa878cee1ee66a07af716118113ca452f51003"},"schema_version":"1.0"},"canonical_sha256":"847a0a9a185345307fe7777c61e22dc0a8a848ae64f606f8fc9484fbc818e7c1","source":{"kind":"arxiv","id":"2102.08942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08942","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08942v1","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08942","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"QR5AVGQYKNCT","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_16","alias_value":"QR5AVGQYKNCTA77H","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_8","alias_value":"QR5AVGQY","created_at":"2026-07-05T02:16:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QR5AVGQYKNCTA77HO56GDYRNYC","target":"record","payload":{"canonical_record":{"source":{"id":"2102.08942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-17T18:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"372547727853b4c0b91c533bc471e5dfaa449455bf73678af25a72ef05657cfd","abstract_canon_sha256":"52448e4e225323aa1a4aadb8d5aa878cee1ee66a07af716118113ca452f51003"},"schema_version":"1.0"},"canonical_sha256":"847a0a9a185345307fe7777c61e22dc0a8a848ae64f606f8fc9484fbc818e7c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:09.789983Z","signature_b64":"XuTFCVppbmOZAGuhOb0tinr/UQm4/JSJItGwEITK9lm1mwPL5bX+4yIrSaLIdfoareXf5jat/+CjgyaO/F2eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847a0a9a185345307fe7777c61e22dc0a8a848ae64f606f8fc9484fbc818e7c1","last_reissued_at":"2026-07-05T02:16:09.789374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:09.789374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.08942","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-07-05T02:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dg7+JpHEEYDO4pCk+eIzf0PLYMYAwzbPDkgyMk/qcU6joYD27vJDWDgNMM9uqbm//owcwTmGLJfK/0gmq3WmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:44:53.942523Z"},"content_sha256":"5e6a75971aa8952087a7e4125b2d0da72c8c69c56e7ada5dee85c3746a045600","schema_version":"1.0","event_id":"sha256:5e6a75971aa8952087a7e4125b2d0da72c8c69c56e7ada5dee85c3746a045600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QR5AVGQYKNCTA77HO56GDYRNYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey on Locality Sensitive Hashing Algorithms and their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chidambaram Crushev, Khandker Mushfiqul Islam, Omid Jafari, Parth Nagarkar, Preeti Maurya","submitted_at":"2021-02-17T18:56:03Z","abstract_excerpt":"Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular techniques for finding approximate nearest neighbor searches in high-dimensional spaces. The main benefits of LSH are its sub-linear query performance and theoretical guarantees on the query accuracy. In this survey paper, we provide a review of state-of-the-art LSH and Distributed LSH techniques. Most importantly, unlike any other prior survey, we present how Locality Sensitive Hashing is utilized in different applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08942","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.08942/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5GKf8Wxk2NCJXN3+bQM30B6Gnnqqveh7UTFU7nhkLNT8kXXhCt4A3gHOcFCIT0rvMjyPao086ddtRWU9Z5NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:44:53.942817Z"},"content_sha256":"76cbb3f2889ce30fc3f800da84e6a1c1fdc40dd44b030241779789063c37f035","schema_version":"1.0","event_id":"sha256:76cbb3f2889ce30fc3f800da84e6a1c1fdc40dd44b030241779789063c37f035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QR5AVGQYKNCTA77HO56GDYRNYC/bundle.json","state_url":"https://pith.science/pith/QR5AVGQYKNCTA77HO56GDYRNYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QR5AVGQYKNCTA77HO56GDYRNYC/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-08-01T17:44:53Z","links":{"resolver":"https://pith.science/pith/QR5AVGQYKNCTA77HO56GDYRNYC","bundle":"https://pith.science/pith/QR5AVGQYKNCTA77HO56GDYRNYC/bundle.json","state":"https://pith.science/pith/QR5AVGQYKNCTA77HO56GDYRNYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QR5AVGQYKNCTA77HO56GDYRNYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QR5AVGQYKNCTA77HO56GDYRNYC","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":"52448e4e225323aa1a4aadb8d5aa878cee1ee66a07af716118113ca452f51003","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-17T18:56:03Z","title_canon_sha256":"372547727853b4c0b91c533bc471e5dfaa449455bf73678af25a72ef05657cfd"},"schema_version":"1.0","source":{"id":"2102.08942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08942","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08942v1","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08942","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"QR5AVGQYKNCT","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_16","alias_value":"QR5AVGQYKNCTA77H","created_at":"2026-07-05T02:16:09Z"},{"alias_kind":"pith_short_8","alias_value":"QR5AVGQY","created_at":"2026-07-05T02:16:09Z"}],"graph_snapshots":[{"event_id":"sha256:76cbb3f2889ce30fc3f800da84e6a1c1fdc40dd44b030241779789063c37f035","target":"graph","created_at":"2026-07-05T02:16:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.08942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular techniques for finding approximate nearest neighbor searches in high-dimensional spaces. The main benefits of LSH are its sub-linear query performance and theoretical guarantees on the query accuracy. In this survey paper, we provide a review of state-of-the-art LSH and Distributed LSH techniques. Most importantly, unlike any other prior survey, we present how Locality Sensitive Hashing is utilized in different applicat","authors_text":"Chidambaram Crushev, Khandker Mushfiqul Islam, Omid Jafari, Parth Nagarkar, Preeti Maurya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-17T18:56:03Z","title":"A Survey on Locality Sensitive Hashing Algorithms and their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08942","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:5e6a75971aa8952087a7e4125b2d0da72c8c69c56e7ada5dee85c3746a045600","target":"record","created_at":"2026-07-05T02:16:09Z","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":"52448e4e225323aa1a4aadb8d5aa878cee1ee66a07af716118113ca452f51003","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-17T18:56:03Z","title_canon_sha256":"372547727853b4c0b91c533bc471e5dfaa449455bf73678af25a72ef05657cfd"},"schema_version":"1.0","source":{"id":"2102.08942","kind":"arxiv","version":1}},"canonical_sha256":"847a0a9a185345307fe7777c61e22dc0a8a848ae64f606f8fc9484fbc818e7c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847a0a9a185345307fe7777c61e22dc0a8a848ae64f606f8fc9484fbc818e7c1","first_computed_at":"2026-07-05T02:16:09.789374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:16:09.789374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XuTFCVppbmOZAGuhOb0tinr/UQm4/JSJItGwEITK9lm1mwPL5bX+4yIrSaLIdfoareXf5jat/+CjgyaO/F2eCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:16:09.789983Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.08942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e6a75971aa8952087a7e4125b2d0da72c8c69c56e7ada5dee85c3746a045600","sha256:76cbb3f2889ce30fc3f800da84e6a1c1fdc40dd44b030241779789063c37f035"],"state_sha256":"394ba67bad95e7b5fe21206720f58282ad9ea6130ebbd1dbaf6f7d19606f87ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ws8qAJaeh3TNeSi3mMdKnN5v5t7OK5xZFzVlmABUXDdqYcLQSnqbS4OQC65llyQojJjSGHYMN2TktHQBvtB+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T17:44:53.945772Z","bundle_sha256":"f61b9f49772e97c3d8deeacd6e60cc9d33c3fda1a9a4b61ff9b69e2315f662ba"}}