{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XSKQ3KCEWY3ALMADAS3NUETUNI","short_pith_number":"pith:XSKQ3KCE","canonical_record":{"source":{"id":"1412.3103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-12-09T18:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"c491743aa924835fbb6b51c35244dafbfc6382660c1532a544630292522b6c05","abstract_canon_sha256":"683ab8ef888df93645b6e3b765da8eb45aa78435fc408f96ca8c7fecc3dec1bc"},"schema_version":"1.0"},"canonical_sha256":"bc950da844b63605b00304b6da12746a041c526e0812b3c04eebfb6c1a077e88","source":{"kind":"arxiv","id":"1412.3103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3103","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3103v1","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3103","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"XSKQ3KCEWY3A","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XSKQ3KCEWY3ALMAD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XSKQ3KCE","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XSKQ3KCEWY3ALMADAS3NUETUNI","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-12-09T18:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"c491743aa924835fbb6b51c35244dafbfc6382660c1532a544630292522b6c05","abstract_canon_sha256":"683ab8ef888df93645b6e3b765da8eb45aa78435fc408f96ca8c7fecc3dec1bc"},"schema_version":"1.0"},"canonical_sha256":"bc950da844b63605b00304b6da12746a041c526e0812b3c04eebfb6c1a077e88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:51.837226Z","signature_b64":"1Ogt8ooHxEkICz84j6Z/Ws0NzY1axv3H/Rk5SkM0RDMix2+B8cesx8GN5ar1lrOLzJs9znlcGIpyP0IADwpIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc950da844b63605b00304b6da12746a041c526e0812b3c04eebfb6c1a077e88","last_reissued_at":"2026-05-18T01:11:51.836750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:51.836750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3103","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-05-18T01:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3eti480DqpCaBWMEJUhmm/tgAZViWo9tp4jUd95o4/8sZNm5bdLbx6QiaC3HKvCyDteJdYIEU0d5vwBzZdABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:22:43.441423Z"},"content_sha256":"d4075b75e282e176a727f84730548ae6622471c072f37395ef74f66b435e9cc8","schema_version":"1.0","event_id":"sha256:d4075b75e282e176a727f84730548ae6622471c072f37395ef74f66b435e9cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XSKQ3KCEWY3ALMADAS3NUETUNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Hypothesis Tests for Adaptive Locality Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aniket Chakrabarti, Srinivasan Parthasarathy","submitted_at":"2014-12-09T18:31:17Z","abstract_excerpt":"All pairs similarity search is a problem where a set of data objects is given and the task is to find all pairs of objects that have similarity above a certain threshold for a given similarity measure-of-interest. When the number of points or dimensionality is high, standard solutions fail to scale gracefully. Approximate solutions such as Locality Sensitive Hashing (LSH) and its Bayesian variants (BayesLSH and BayesLSHLite) alleviate the problem to some extent and provides substantial speedup over traditional index based approaches. BayesLSH is used for pruning the candidate space and computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3103","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":""},"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-18T01:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7iNDqdaPigQIu1poH9L9K6Fmr1Ezjen+l+UmETQXwx2u3Q739M3yNF8qq4b02C2to8S26+oIBaYWKGJXRhDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:22:43.441973Z"},"content_sha256":"029f864225f13f2f86c14c8bd7957868d370e4ac21f5f9ca013e58d251bb2e3c","schema_version":"1.0","event_id":"sha256:029f864225f13f2f86c14c8bd7957868d370e4ac21f5f9ca013e58d251bb2e3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/bundle.json","state_url":"https://pith.science/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/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-06-04T22:22:43Z","links":{"resolver":"https://pith.science/pith/XSKQ3KCEWY3ALMADAS3NUETUNI","bundle":"https://pith.science/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/bundle.json","state":"https://pith.science/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSKQ3KCEWY3ALMADAS3NUETUNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XSKQ3KCEWY3ALMADAS3NUETUNI","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":"683ab8ef888df93645b6e3b765da8eb45aa78435fc408f96ca8c7fecc3dec1bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-12-09T18:31:17Z","title_canon_sha256":"c491743aa924835fbb6b51c35244dafbfc6382660c1532a544630292522b6c05"},"schema_version":"1.0","source":{"id":"1412.3103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3103","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3103v1","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3103","created_at":"2026-05-18T01:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"XSKQ3KCEWY3A","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XSKQ3KCEWY3ALMAD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XSKQ3KCE","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:029f864225f13f2f86c14c8bd7957868d370e4ac21f5f9ca013e58d251bb2e3c","target":"graph","created_at":"2026-05-18T01:11:51Z","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":"All pairs similarity search is a problem where a set of data objects is given and the task is to find all pairs of objects that have similarity above a certain threshold for a given similarity measure-of-interest. When the number of points or dimensionality is high, standard solutions fail to scale gracefully. Approximate solutions such as Locality Sensitive Hashing (LSH) and its Bayesian variants (BayesLSH and BayesLSHLite) alleviate the problem to some extent and provides substantial speedup over traditional index based approaches. BayesLSH is used for pruning the candidate space and computa","authors_text":"Aniket Chakrabarti, Srinivasan Parthasarathy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-12-09T18:31:17Z","title":"Sequential Hypothesis Tests for Adaptive Locality Sensitive Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3103","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:d4075b75e282e176a727f84730548ae6622471c072f37395ef74f66b435e9cc8","target":"record","created_at":"2026-05-18T01:11:51Z","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":"683ab8ef888df93645b6e3b765da8eb45aa78435fc408f96ca8c7fecc3dec1bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-12-09T18:31:17Z","title_canon_sha256":"c491743aa924835fbb6b51c35244dafbfc6382660c1532a544630292522b6c05"},"schema_version":"1.0","source":{"id":"1412.3103","kind":"arxiv","version":1}},"canonical_sha256":"bc950da844b63605b00304b6da12746a041c526e0812b3c04eebfb6c1a077e88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc950da844b63605b00304b6da12746a041c526e0812b3c04eebfb6c1a077e88","first_computed_at":"2026-05-18T01:11:51.836750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:51.836750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Ogt8ooHxEkICz84j6Z/Ws0NzY1axv3H/Rk5SkM0RDMix2+B8cesx8GN5ar1lrOLzJs9znlcGIpyP0IADwpIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:51.837226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4075b75e282e176a727f84730548ae6622471c072f37395ef74f66b435e9cc8","sha256:029f864225f13f2f86c14c8bd7957868d370e4ac21f5f9ca013e58d251bb2e3c"],"state_sha256":"725e32fce0978d6df802a9d04cd00fab51ad72fde17bbcb0fb602aeedf6d8426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zEP/LSZ0+SX1mieV2fWqn2MutpEmEEJPcKmAA1SlKNwlmr/YcPowGOTTY+5+s2/VYSQrc8RB0JIp3603CBkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:22:43.445061Z","bundle_sha256":"0d1e32b5753dceef03d948081437d8c85c7ee4a638e3385bef8f7d5bc3a22f78"}}