{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U7XEXPAFQXVN434DBBDNVMGOPG","short_pith_number":"pith:U7XEXPAF","canonical_record":{"source":{"id":"1704.02054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T23:44:31Z","cross_cats_sorted":[],"title_canon_sha256":"97587f3d60ab7951b6a4b878795250b76a9f7a00c1f2707c9260422000defa6a","abstract_canon_sha256":"cb1dc2c0027660a53fb3835a4592f15d9dd360bb34715e2ee2704becd6b262be"},"schema_version":"1.0"},"canonical_sha256":"a7ee4bbc0585eade6f830846dab0ce79801b14a76ad05b5f251a46b43e7916ef","source":{"kind":"arxiv","id":"1704.02054","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02054","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02054v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02054","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"U7XEXPAFQXVN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7XEXPAFQXVN434D","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7XEXPAF","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U7XEXPAFQXVN434DBBDNVMGOPG","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T23:44:31Z","cross_cats_sorted":[],"title_canon_sha256":"97587f3d60ab7951b6a4b878795250b76a9f7a00c1f2707c9260422000defa6a","abstract_canon_sha256":"cb1dc2c0027660a53fb3835a4592f15d9dd360bb34715e2ee2704becd6b262be"},"schema_version":"1.0"},"canonical_sha256":"a7ee4bbc0585eade6f830846dab0ce79801b14a76ad05b5f251a46b43e7916ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.334187Z","signature_b64":"KqV22AtKeFh93F1suL3UffBnH06U4nQ5uusN1uKaejkuLdYhuanHRNMjOQhvvBrQmU5wjZlDeU9cs2mOXY9uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ee4bbc0585eade6f830846dab0ce79801b14a76ad05b5f251a46b43e7916ef","last_reissued_at":"2026-05-18T00:12:14.333715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.333715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02054","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7S8rrpqWzLWa6fuffkfhJG6gDKhXLEiyy1XGsCoHkM7mlti/Q2om2zyaLHU4IxGaTTDl9MLeYnf9k2pv+zNUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:55:37.329895Z"},"content_sha256":"a5da75aaa5d4b746c390211c1b72049a65f59ee6d7e58d773cb49d91658a6b18","schema_version":"1.0","event_id":"sha256:a5da75aaa5d4b746c390211c1b72049a65f59ee6d7e58d773cb49d91658a6b18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U7XEXPAFQXVN434DBBDNVMGOPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Las Vegas Locality Sensitive Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thomas Dybdahl Ahle","submitted_at":"2017-04-06T23:44:31Z","abstract_excerpt":"We show that approximate similarity (near neighbour) search can be solved in high dimensions with performance matching state of the art (data independent) Locality Sensitive Hashing, but with a guarantee of no false negatives.\n  Specifically, we give two data structures for common problems.\n  For $c$-approximate near neighbour in Hamming space we get query time $dn^{1/c+o(1)}$ and space $dn^{1+1/c+o(1)}$ matching that of \\cite{indyk1998approximate} and answering a long standing open question from~\\cite{indyk2000dimensionality} and~\\cite{pagh2016locality} in the affirmative.\n  By means of a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02054","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-18T00:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bdlo9E/HSgRlaiGbkxY5/ETOgQdKhZbEuXrFb3hzJ4nizaVqDVR92hXuKE+rqgbEQZFkOLPTWjkOSs4tUJ2KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:55:37.330658Z"},"content_sha256":"5b07a0ffdbd135c9a4343b11205b5ec4bb2b96a4516f839dd3f53cf24ea24e5e","schema_version":"1.0","event_id":"sha256:5b07a0ffdbd135c9a4343b11205b5ec4bb2b96a4516f839dd3f53cf24ea24e5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7XEXPAFQXVN434DBBDNVMGOPG/bundle.json","state_url":"https://pith.science/pith/U7XEXPAFQXVN434DBBDNVMGOPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7XEXPAFQXVN434DBBDNVMGOPG/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-26T18:55:37Z","links":{"resolver":"https://pith.science/pith/U7XEXPAFQXVN434DBBDNVMGOPG","bundle":"https://pith.science/pith/U7XEXPAFQXVN434DBBDNVMGOPG/bundle.json","state":"https://pith.science/pith/U7XEXPAFQXVN434DBBDNVMGOPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7XEXPAFQXVN434DBBDNVMGOPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U7XEXPAFQXVN434DBBDNVMGOPG","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":"cb1dc2c0027660a53fb3835a4592f15d9dd360bb34715e2ee2704becd6b262be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T23:44:31Z","title_canon_sha256":"97587f3d60ab7951b6a4b878795250b76a9f7a00c1f2707c9260422000defa6a"},"schema_version":"1.0","source":{"id":"1704.02054","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02054","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02054v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02054","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"U7XEXPAFQXVN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7XEXPAFQXVN434D","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7XEXPAF","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5b07a0ffdbd135c9a4343b11205b5ec4bb2b96a4516f839dd3f53cf24ea24e5e","target":"graph","created_at":"2026-05-18T00:12: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":"We show that approximate similarity (near neighbour) search can be solved in high dimensions with performance matching state of the art (data independent) Locality Sensitive Hashing, but with a guarantee of no false negatives.\n  Specifically, we give two data structures for common problems.\n  For $c$-approximate near neighbour in Hamming space we get query time $dn^{1/c+o(1)}$ and space $dn^{1+1/c+o(1)}$ matching that of \\cite{indyk1998approximate} and answering a long standing open question from~\\cite{indyk2000dimensionality} and~\\cite{pagh2016locality} in the affirmative.\n  By means of a new","authors_text":"Thomas Dybdahl Ahle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T23:44:31Z","title":"Optimal Las Vegas Locality Sensitive Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02054","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:a5da75aaa5d4b746c390211c1b72049a65f59ee6d7e58d773cb49d91658a6b18","target":"record","created_at":"2026-05-18T00:12: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":"cb1dc2c0027660a53fb3835a4592f15d9dd360bb34715e2ee2704becd6b262be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T23:44:31Z","title_canon_sha256":"97587f3d60ab7951b6a4b878795250b76a9f7a00c1f2707c9260422000defa6a"},"schema_version":"1.0","source":{"id":"1704.02054","kind":"arxiv","version":3}},"canonical_sha256":"a7ee4bbc0585eade6f830846dab0ce79801b14a76ad05b5f251a46b43e7916ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7ee4bbc0585eade6f830846dab0ce79801b14a76ad05b5f251a46b43e7916ef","first_computed_at":"2026-05-18T00:12:14.333715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:14.333715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqV22AtKeFh93F1suL3UffBnH06U4nQ5uusN1uKaejkuLdYhuanHRNMjOQhvvBrQmU5wjZlDeU9cs2mOXY9uDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:14.334187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02054","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5da75aaa5d4b746c390211c1b72049a65f59ee6d7e58d773cb49d91658a6b18","sha256:5b07a0ffdbd135c9a4343b11205b5ec4bb2b96a4516f839dd3f53cf24ea24e5e"],"state_sha256":"12be56102ad482e550db1ab28d83cfe7a904e6d573fdbcdbda44bb288b8d71e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHk4/j7S5ko0gE6mX1J7sWXy+AOJzC1yRm020pHb65TA/dnW4/o5crrMOxRERzsMqpOLy0b0QTgx/hFp6JIrCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:55:37.334664Z","bundle_sha256":"f7d77c31be5534423e3c74822b4182aac0f0b85721c7eab224af27d5000fd125"}}