{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3M5UW23EIIYSBKW43GGWTPWK7W","short_pith_number":"pith:3M5UW23E","schema_version":"1.0","canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","source":{"kind":"arxiv","id":"1110.1328","version":3},"attestation_state":"computed","paper":{"title":"Bayesian Locality Sensitive Hashing for Fast Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Srinivasan Parthasarathy, Venu Satuluri","submitted_at":"2011-10-06T17:13:48Z","abstract_excerpt":"Given a collection of objects and an associated similarity measure, the all-pairs similarity search problem asks us to find all pairs of objects with similarity greater than a certain user-specified threshold. Locality-sensitive hashing (LSH) based methods have become a very popular approach for this problem. However, most such methods only use LSH for the first phase of similarity search - i.e. efficient indexing for candidate generation. In this paper, we present BayesLSH, a principled Bayesian algorithm for the subsequent phase of similarity search - performing candidate pruning and similar"},"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":"1110.1328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-06T17:13:48Z","cross_cats_sorted":["cs.AI","cs.DS","cs.IR"],"title_canon_sha256":"4c474a17de304a6599ae41b3ba964580aa81f25d8202509c2009b218a1b59e8c","abstract_canon_sha256":"fa684c2c74805ffbc76348881341c6f58c0ce50747362d75d187429123a8a689"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:12.232506Z","signature_b64":"eJKTlVCZoaj076jPGvJg8ObJTAtu9YvlGi+0JHcJ7+sXxXv0cj+M1GbYSRsCv2NlIyaAxeIhoq/MbORU37mFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","last_reissued_at":"2026-05-18T03:59:12.231764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:12.231764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Locality Sensitive Hashing for Fast Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Srinivasan Parthasarathy, Venu Satuluri","submitted_at":"2011-10-06T17:13:48Z","abstract_excerpt":"Given a collection of objects and an associated similarity measure, the all-pairs similarity search problem asks us to find all pairs of objects with similarity greater than a certain user-specified threshold. Locality-sensitive hashing (LSH) based methods have become a very popular approach for this problem. However, most such methods only use LSH for the first phase of similarity search - i.e. efficient indexing for candidate generation. In this paper, we present BayesLSH, a principled Bayesian algorithm for the subsequent phase of similarity search - performing candidate pruning and similar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1328","kind":"arxiv","version":3},"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":"1110.1328","created_at":"2026-05-18T03:59:12.231876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1328v3","created_at":"2026-05-18T03:59:12.231876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1328","created_at":"2026-05-18T03:59:12.231876+00:00"},{"alias_kind":"pith_short_12","alias_value":"3M5UW23EIIYS","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3M5UW23EIIYSBKW4","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3M5UW23E","created_at":"2026-05-18T12:26:18.847500+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/3M5UW23EIIYSBKW43GGWTPWK7W","json":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W.json","graph_json":"https://pith.science/api/pith-number/3M5UW23EIIYSBKW43GGWTPWK7W/graph.json","events_json":"https://pith.science/api/pith-number/3M5UW23EIIYSBKW43GGWTPWK7W/events.json","paper":"https://pith.science/paper/3M5UW23E"},"agent_actions":{"view_html":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W","download_json":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W.json","view_paper":"https://pith.science/paper/3M5UW23E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1328&json=true","fetch_graph":"https://pith.science/api/pith-number/3M5UW23EIIYSBKW43GGWTPWK7W/graph.json","fetch_events":"https://pith.science/api/pith-number/3M5UW23EIIYSBKW43GGWTPWK7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/action/storage_attestation","attest_author":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/action/author_attestation","sign_citation":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/action/citation_signature","submit_replication":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/action/replication_record"}},"created_at":"2026-05-18T03:59:12.231876+00:00","updated_at":"2026-05-18T03:59:12.231876+00:00"}