{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3M5UW23EIIYSBKW43GGWTPWK7W","short_pith_number":"pith:3M5UW23E","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"},"canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","source":{"kind":"arxiv","id":"1110.1328","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1328","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1328v3","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1328","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"3M5UW23EIIYS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3M5UW23EIIYSBKW4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3M5UW23E","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3M5UW23EIIYSBKW43GGWTPWK7W","target":"record","payload":{"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"},"canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","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"},"source_kind":"arxiv","source_id":"1110.1328","source_version":3,"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-18T03:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TxvNXX6YRpDwmtAvJGnY9lKFh8VzBTDy4JeQ8zRl4SvW3VdMl5KTLzcUlVFlaUoN7GSMAstELYDyqEYC6fZTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:12:17.685004Z"},"content_sha256":"ca4a4aa278ca42afcef3989ecae5802092f52235f04d70b9fe2f22b4c4cbc439","schema_version":"1.0","event_id":"sha256:ca4a4aa278ca42afcef3989ecae5802092f52235f04d70b9fe2f22b4c4cbc439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3M5UW23EIIYSBKW43GGWTPWK7W","target":"graph","payload":{"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"},"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-18T03:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FVTSOrZagZ3Vb8JsoZJlkG9gtX0/CXJCKrGbRwDY1WQtK0RnTLNlDdbfCxL5GbIwwIqMjk1J/3Epr4LKQuMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:12:17.685735Z"},"content_sha256":"51662a9ec748c03ad353359ad1a07191f6ae3526a6a0b066302d64373606238a","schema_version":"1.0","event_id":"sha256:51662a9ec748c03ad353359ad1a07191f6ae3526a6a0b066302d64373606238a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/bundle.json","state_url":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3M5UW23EIIYSBKW43GGWTPWK7W/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-20T01:12:17Z","links":{"resolver":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W","bundle":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/bundle.json","state":"https://pith.science/pith/3M5UW23EIIYSBKW43GGWTPWK7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3M5UW23EIIYSBKW43GGWTPWK7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3M5UW23EIIYSBKW43GGWTPWK7W","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":"fa684c2c74805ffbc76348881341c6f58c0ce50747362d75d187429123a8a689","cross_cats_sorted":["cs.AI","cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-06T17:13:48Z","title_canon_sha256":"4c474a17de304a6599ae41b3ba964580aa81f25d8202509c2009b218a1b59e8c"},"schema_version":"1.0","source":{"id":"1110.1328","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1328","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1328v3","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1328","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"3M5UW23EIIYS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3M5UW23EIIYSBKW4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3M5UW23E","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:51662a9ec748c03ad353359ad1a07191f6ae3526a6a0b066302d64373606238a","target":"graph","created_at":"2026-05-18T03:59:12Z","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":"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","authors_text":"Srinivasan Parthasarathy, Venu Satuluri","cross_cats":["cs.AI","cs.DS","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-06T17:13:48Z","title":"Bayesian Locality Sensitive Hashing for Fast Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1328","kind":"arxiv","version":3},"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:ca4a4aa278ca42afcef3989ecae5802092f52235f04d70b9fe2f22b4c4cbc439","target":"record","created_at":"2026-05-18T03:59:12Z","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":"fa684c2c74805ffbc76348881341c6f58c0ce50747362d75d187429123a8a689","cross_cats_sorted":["cs.AI","cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-06T17:13:48Z","title_canon_sha256":"4c474a17de304a6599ae41b3ba964580aa81f25d8202509c2009b218a1b59e8c"},"schema_version":"1.0","source":{"id":"1110.1328","kind":"arxiv","version":3}},"canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db3b4b6b64423120aadcd98d69becafd9b2972dd8d85b8d02791e3a346b39576","first_computed_at":"2026-05-18T03:59:12.231764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:12.231764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eJKTlVCZoaj076jPGvJg8ObJTAtu9YvlGi+0JHcJ7+sXxXv0cj+M1GbYSRsCv2NlIyaAxeIhoq/MbORU37mFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:12.232506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1328","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca4a4aa278ca42afcef3989ecae5802092f52235f04d70b9fe2f22b4c4cbc439","sha256:51662a9ec748c03ad353359ad1a07191f6ae3526a6a0b066302d64373606238a"],"state_sha256":"5d8195bbd6f696767c80aa8e56739698801997f840d85b043feac29d7ebf1762"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhP632kRfYjvT4oPt80aFdKw5ETyIztwWAdv7YXy8/GSnpcz5G1dQr+hrvFKsnP1eagNbRz0hNPlSDWDiTV/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:12:17.689628Z","bundle_sha256":"90bfee9f8dadb5cb033a5e78460ac128d923e7c0c9b5e37fc8ea310d854fae73"}}