{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2JZNE2OUE5DQ7JWKLBF2VL7ZBB","short_pith_number":"pith:2JZNE2OU","canonical_record":{"source":{"id":"1708.07586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"0679d464ad3a702c7f56e3ec6b3d7fa61cd6855bee2e89268757df46821a5db4","abstract_canon_sha256":"ad0827f374ca9a1f62a614cdf6052b4e343a811597885ff0cde944e9744ee462"},"schema_version":"1.0"},"canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","source":{"kind":"arxiv","id":"1708.07586","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07586","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07586v2","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07586","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"2JZNE2OUE5DQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JZNE2OUE5DQ7JWK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JZNE2OU","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2JZNE2OUE5DQ7JWKLBF2VL7ZBB","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"0679d464ad3a702c7f56e3ec6b3d7fa61cd6855bee2e89268757df46821a5db4","abstract_canon_sha256":"ad0827f374ca9a1f62a614cdf6052b4e343a811597885ff0cde944e9744ee462"},"schema_version":"1.0"},"canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:14.005370Z","signature_b64":"f4LPYWI+5plLf+0s/bJM/jZWPjE+ts8pKYCTvATN9/3gGXDIRM12XOLj2KetXsSfhezPFvYYAJIJCjA4PHcADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","last_reissued_at":"2026-05-18T00:23:14.004720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:14.004720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07586","source_version":2,"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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrO58ZmMAq4cEwaRi/FKSLpPhiNL24lRgDd90jk2f9HT7cM6HYOj3M4DDoPIiILk3Lex10aGdy7PBgjRI3yFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:37.197701Z"},"content_sha256":"bfb843d5f99b69a9dd96ddcd79869e2f4a25071a9cc1cf5994ace715ffb422c5","schema_version":"1.0","event_id":"sha256:bfb843d5f99b69a9dd96ddcd79869e2f4a25071a9cc1cf5994ace715ffb422c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2JZNE2OUE5DQ7JWKLBF2VL7ZBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias Christiani","submitted_at":"2017-08-25T00:47:38Z","abstract_excerpt":"The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\\rho} \\log n)$ evaluations of hash functions from $\\mathcal{H}$ and $O(n^{\\rho})$ hash table lookups and distance computations where $\\rho \\in (0,1)$ is determined by the locality-sensitivity properties of $\\mathcal{H}$. It follows from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07586","kind":"arxiv","version":2},"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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLW9t0IKRTcYiZ37Wrr8Z4w8JcIGBgp6JVdmxdTFef9OH2YdAQtZsqWbSorYW2esIYWuddYF2lLEowBQooBhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:37.198393Z"},"content_sha256":"f5b658b60dee0b83610e400c92cd119bff792379d769f72be93fbdbb7cc3284a","schema_version":"1.0","event_id":"sha256:f5b658b60dee0b83610e400c92cd119bff792379d769f72be93fbdbb7cc3284a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/bundle.json","state_url":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/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-26T17:05:37Z","links":{"resolver":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB","bundle":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/bundle.json","state":"https://pith.science/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JZNE2OUE5DQ7JWKLBF2VL7ZBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2JZNE2OUE5DQ7JWKLBF2VL7ZBB","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":"ad0827f374ca9a1f62a614cdf6052b4e343a811597885ff0cde944e9744ee462","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","title_canon_sha256":"0679d464ad3a702c7f56e3ec6b3d7fa61cd6855bee2e89268757df46821a5db4"},"schema_version":"1.0","source":{"id":"1708.07586","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07586","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07586v2","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07586","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"2JZNE2OUE5DQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JZNE2OUE5DQ7JWK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JZNE2OU","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f5b658b60dee0b83610e400c92cd119bff792379d769f72be93fbdbb7cc3284a","target":"graph","created_at":"2026-05-18T00:23:14Z","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":"The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\\rho} \\log n)$ evaluations of hash functions from $\\mathcal{H}$ and $O(n^{\\rho})$ hash table lookups and distance computations where $\\rho \\in (0,1)$ is determined by the locality-sensitivity properties of $\\mathcal{H}$. It follows from ","authors_text":"Tobias Christiani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","title":"Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07586","kind":"arxiv","version":2},"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:bfb843d5f99b69a9dd96ddcd79869e2f4a25071a9cc1cf5994ace715ffb422c5","target":"record","created_at":"2026-05-18T00:23:14Z","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":"ad0827f374ca9a1f62a614cdf6052b4e343a811597885ff0cde944e9744ee462","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T00:47:38Z","title_canon_sha256":"0679d464ad3a702c7f56e3ec6b3d7fa61cd6855bee2e89268757df46821a5db4"},"schema_version":"1.0","source":{"id":"1708.07586","kind":"arxiv","version":2}},"canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d272d269d427470fa6ca584baaaff90854eb21d01f4706f20d3fe85fd5848763","first_computed_at":"2026-05-18T00:23:14.004720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:14.004720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4LPYWI+5plLf+0s/bJM/jZWPjE+ts8pKYCTvATN9/3gGXDIRM12XOLj2KetXsSfhezPFvYYAJIJCjA4PHcADg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:14.005370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07586","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfb843d5f99b69a9dd96ddcd79869e2f4a25071a9cc1cf5994ace715ffb422c5","sha256:f5b658b60dee0b83610e400c92cd119bff792379d769f72be93fbdbb7cc3284a"],"state_sha256":"089af24c089b8c7bc73bbfb2ebadcfd8c07c14c22c7f935e78434b8eb9069cd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzAtYkarMFMjBS/r8vLNnQFTOnXHLTq0mkQ3ijcjtJx1O9P89pnz7QUTWSTpzpz0bJlWFemki2JMwBAmOAmfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:05:37.201881Z","bundle_sha256":"e83be21cae3660397a32c6735ef3b77d2dc1e546f25bf3a2095b1a23327733fd"}}