{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZBMWOCOP3TIO5C274AXKIJKRV7","short_pith_number":"pith:ZBMWOCOP","canonical_record":{"source":{"id":"2004.07286","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T18:41:54Z","cross_cats_sorted":["cs.CG","cs.IR"],"title_canon_sha256":"93351d6dfa924981a917543c2529a3d79db405413eef84bebffc54e36fc51eb3","abstract_canon_sha256":"9c44cf11417e2b744a48ec9314c5f895e41837b7a8dad6412acc3fa0f024671c"},"schema_version":"1.0"},"canonical_sha256":"c8596709cfdcd0ee8b5fe02ea42551aff05a53c06e023f95e98060a31ca5583c","source":{"kind":"arxiv","id":"2004.07286","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07286","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07286v3","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07286","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZBMWOCOP3TIO","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_16","alias_value":"ZBMWOCOP3TIO5C27","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_8","alias_value":"ZBMWOCOP","created_at":"2026-07-05T00:57:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZBMWOCOP3TIO5C274AXKIJKRV7","target":"record","payload":{"canonical_record":{"source":{"id":"2004.07286","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T18:41:54Z","cross_cats_sorted":["cs.CG","cs.IR"],"title_canon_sha256":"93351d6dfa924981a917543c2529a3d79db405413eef84bebffc54e36fc51eb3","abstract_canon_sha256":"9c44cf11417e2b744a48ec9314c5f895e41837b7a8dad6412acc3fa0f024671c"},"schema_version":"1.0"},"canonical_sha256":"c8596709cfdcd0ee8b5fe02ea42551aff05a53c06e023f95e98060a31ca5583c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:26.397994Z","signature_b64":"xp03yNznCJhZvnTBCZVf9yxFPWWYyGEk8f+dbsg/M+mmIYHlMBDfwDoKvwwCilHCvx5w6WzsTk9GXpUudhMICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8596709cfdcd0ee8b5fe02ea42551aff05a53c06e023f95e98060a31ca5583c","last_reissued_at":"2026-07-05T00:57:26.397548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:26.397548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.07286","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-07-05T00:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8DGAbdy0kbR6TpEoA2z4n3FPcZ/rOho2ROEQo4pnXKiBq9YJ78MeGM0f5mCBFdUVmvrV7CCbUIVFBPJaStdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:26:38.822338Z"},"content_sha256":"e1c64f6bc0259b204fe433135844a4c2b33b9f8796a3378c228840fd998e98a8","schema_version":"1.0","event_id":"sha256:e1c64f6bc0259b204fe433135844a4c2b33b9f8796a3378c228840fd998e98a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZBMWOCOP3TIO5C274AXKIJKRV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.IR"],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Jay Tenenbaum","submitted_at":"2020-04-15T18:41:54Z","abstract_excerpt":"Locality Sensitive Hashing (LSH) is an effective method to index a set of points such that we can efficiently find the nearest neighbors of a query point. We extend this method to our novel Set-query LSH (SLSH), such that it can find the nearest neighbors of a set of points, given as a query.\n  Let $ s(x,y) $ be the similarity between two points $ x $ and $ y $. We define a similarity between a set $ Q$ and a point $ x $ by aggregating the similarities $ s(p,x) $ for all $ p\\in Q $. For example, we can take $ s(p,x) $ to be the angular similarity between $ p $ and $ x $ (i.e., $1-{\\angle (x,p)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07286","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.07286/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-05T00:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LPD9eOOno+Ngh49HkvyJ+XuLc+bI0hPYxKYR79E2IwZCyfzRZmK4JBj/sTUgaH4QJG8nthNppiOOkvpB3K6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:26:38.822714Z"},"content_sha256":"fe200fdb1a29e76451fb97a8ab2132b23bfd4b24bb0cb3c9131848d48705162f","schema_version":"1.0","event_id":"sha256:fe200fdb1a29e76451fb97a8ab2132b23bfd4b24bb0cb3c9131848d48705162f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/bundle.json","state_url":"https://pith.science/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/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-07-05T10:26:38Z","links":{"resolver":"https://pith.science/pith/ZBMWOCOP3TIO5C274AXKIJKRV7","bundle":"https://pith.science/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/bundle.json","state":"https://pith.science/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBMWOCOP3TIO5C274AXKIJKRV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZBMWOCOP3TIO5C274AXKIJKRV7","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":"9c44cf11417e2b744a48ec9314c5f895e41837b7a8dad6412acc3fa0f024671c","cross_cats_sorted":["cs.CG","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T18:41:54Z","title_canon_sha256":"93351d6dfa924981a917543c2529a3d79db405413eef84bebffc54e36fc51eb3"},"schema_version":"1.0","source":{"id":"2004.07286","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07286","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07286v3","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07286","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZBMWOCOP3TIO","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_16","alias_value":"ZBMWOCOP3TIO5C27","created_at":"2026-07-05T00:57:26Z"},{"alias_kind":"pith_short_8","alias_value":"ZBMWOCOP","created_at":"2026-07-05T00:57:26Z"}],"graph_snapshots":[{"event_id":"sha256:fe200fdb1a29e76451fb97a8ab2132b23bfd4b24bb0cb3c9131848d48705162f","target":"graph","created_at":"2026-07-05T00:57:26Z","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/2004.07286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Locality Sensitive Hashing (LSH) is an effective method to index a set of points such that we can efficiently find the nearest neighbors of a query point. We extend this method to our novel Set-query LSH (SLSH), such that it can find the nearest neighbors of a set of points, given as a query.\n  Let $ s(x,y) $ be the similarity between two points $ x $ and $ y $. We define a similarity between a set $ Q$ and a point $ x $ by aggregating the similarities $ s(p,x) $ for all $ p\\in Q $. For example, we can take $ s(p,x) $ to be the angular similarity between $ p $ and $ x $ (i.e., $1-{\\angle (x,p)","authors_text":"Haim Kaplan, Jay Tenenbaum","cross_cats":["cs.CG","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T18:41:54Z","title":"Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07286","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:e1c64f6bc0259b204fe433135844a4c2b33b9f8796a3378c228840fd998e98a8","target":"record","created_at":"2026-07-05T00:57:26Z","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":"9c44cf11417e2b744a48ec9314c5f895e41837b7a8dad6412acc3fa0f024671c","cross_cats_sorted":["cs.CG","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T18:41:54Z","title_canon_sha256":"93351d6dfa924981a917543c2529a3d79db405413eef84bebffc54e36fc51eb3"},"schema_version":"1.0","source":{"id":"2004.07286","kind":"arxiv","version":3}},"canonical_sha256":"c8596709cfdcd0ee8b5fe02ea42551aff05a53c06e023f95e98060a31ca5583c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8596709cfdcd0ee8b5fe02ea42551aff05a53c06e023f95e98060a31ca5583c","first_computed_at":"2026-07-05T00:57:26.397548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:57:26.397548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xp03yNznCJhZvnTBCZVf9yxFPWWYyGEk8f+dbsg/M+mmIYHlMBDfwDoKvwwCilHCvx5w6WzsTk9GXpUudhMICw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:57:26.397994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.07286","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1c64f6bc0259b204fe433135844a4c2b33b9f8796a3378c228840fd998e98a8","sha256:fe200fdb1a29e76451fb97a8ab2132b23bfd4b24bb0cb3c9131848d48705162f"],"state_sha256":"f979b6d52a1e0ccd32a1d0f1c860146237a65d5bfe046001240d45c6f52ccf1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXMBGlnqwWePQagfvuoB860Y7Dx/StTkJ78H6k+S5/x+2/UrxsOW0hyydBNx2MoE67BSfQ5Rs3fyVbVe1XETAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:26:38.824794Z","bundle_sha256":"e432a79b580b2ed81a10ddb687aa3f1a22c399694899d1279ffb6211601f7d01"}}