{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:63TLTGXLOZFOZVU7CG6AGFZHAH","short_pith_number":"pith:63TLTGXL","canonical_record":{"source":{"id":"1602.04421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-14T06:36:17Z","cross_cats_sorted":[],"title_canon_sha256":"547e9ce882df305a69d3110e7a4e0b2446ae6a38fa68266251e7a50d8516d4d4","abstract_canon_sha256":"f8764bd662368189535ebe860ae0e72ff5df282bf8ca962492ead309621a37a6"},"schema_version":"1.0"},"canonical_sha256":"f6e6b99aeb764aecd69f11bc03172701e3bd28a87910daa1533bc3c597772e81","source":{"kind":"arxiv","id":"1602.04421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04421","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04421v1","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04421","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"63TLTGXLOZFO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"63TLTGXLOZFOZVU7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"63TLTGXL","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:63TLTGXLOZFOZVU7CG6AGFZHAH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-14T06:36:17Z","cross_cats_sorted":[],"title_canon_sha256":"547e9ce882df305a69d3110e7a4e0b2446ae6a38fa68266251e7a50d8516d4d4","abstract_canon_sha256":"f8764bd662368189535ebe860ae0e72ff5df282bf8ca962492ead309621a37a6"},"schema_version":"1.0"},"canonical_sha256":"f6e6b99aeb764aecd69f11bc03172701e3bd28a87910daa1533bc3c597772e81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.946754Z","signature_b64":"pJ64I+gZe2UWIMrtjIHemdD+FVHngSnyF8PvaCyBj39pF9Schx34cvqF7i5cc4YtKz3+BpS8QuzBwqC3b6BmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6e6b99aeb764aecd69f11bc03172701e3bd28a87910daa1533bc3c597772e81","last_reissued_at":"2026-05-18T01:20:50.946213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.946213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04421","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tjaEG5UQjLZdUCaUpOgzSXVAWDGVvU4aeHCT3g82fqg4zBA8s8P+54MMqdRaNqu2yDvT5dT4HW9QYn1wMycOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:46:58.625468Z"},"content_sha256":"0a3776420c33b34793b46aca04a9f6c9da1ce3e51b36881adeb939f023e5e6a2","schema_version":"1.0","event_id":"sha256:0a3776420c33b34793b46aca04a9f6c9da1ce3e51b36881adeb939f023e5e6a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:63TLTGXLOZFOZVU7CG6AGFZHAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized approximate nearest neighbor search with limited adaptivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingmou Liu, Xiaoyin Pan, Yitong Yin","submitted_at":"2016-02-14T06:36:17Z","abstract_excerpt":"We study the fundamental problem of approximate nearest neighbor search in $d$-dimensional Hamming space $\\{0,1\\}^d$. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe model with limited adaptivity, where the algorithm makes $k$ rounds of parallel accesses to the data structure for a given $k$. For any $k\\ge 1$, we give a simple randomized algorithm solving the approximate nearest neighbor search using $k$ rounds of parallel memory accesses, with $O(k(\\log d)^{1/k})$ accesses in total. We also gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04421","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxowMF71jxEpW4rVUmziuATnwe7iMAOkpboa7GeNrWFZK/MbBi3KOswxVKtidWTjJiMbJ5ZA57bsf7ocdB75AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:46:58.626132Z"},"content_sha256":"7caea13792faa41f83cd2b6d9bc840c77b67c7284294f709ff81eba6750ddab9","schema_version":"1.0","event_id":"sha256:7caea13792faa41f83cd2b6d9bc840c77b67c7284294f709ff81eba6750ddab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/bundle.json","state_url":"https://pith.science/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/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-27T14:46:58Z","links":{"resolver":"https://pith.science/pith/63TLTGXLOZFOZVU7CG6AGFZHAH","bundle":"https://pith.science/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/bundle.json","state":"https://pith.science/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63TLTGXLOZFOZVU7CG6AGFZHAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:63TLTGXLOZFOZVU7CG6AGFZHAH","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":"f8764bd662368189535ebe860ae0e72ff5df282bf8ca962492ead309621a37a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-14T06:36:17Z","title_canon_sha256":"547e9ce882df305a69d3110e7a4e0b2446ae6a38fa68266251e7a50d8516d4d4"},"schema_version":"1.0","source":{"id":"1602.04421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04421","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04421v1","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04421","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"63TLTGXLOZFO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"63TLTGXLOZFOZVU7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"63TLTGXL","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7caea13792faa41f83cd2b6d9bc840c77b67c7284294f709ff81eba6750ddab9","target":"graph","created_at":"2026-05-18T01:20:50Z","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 study the fundamental problem of approximate nearest neighbor search in $d$-dimensional Hamming space $\\{0,1\\}^d$. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe model with limited adaptivity, where the algorithm makes $k$ rounds of parallel accesses to the data structure for a given $k$. For any $k\\ge 1$, we give a simple randomized algorithm solving the approximate nearest neighbor search using $k$ rounds of parallel memory accesses, with $O(k(\\log d)^{1/k})$ accesses in total. We also gi","authors_text":"Mingmou Liu, Xiaoyin Pan, Yitong Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-14T06:36:17Z","title":"Randomized approximate nearest neighbor search with limited adaptivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04421","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:0a3776420c33b34793b46aca04a9f6c9da1ce3e51b36881adeb939f023e5e6a2","target":"record","created_at":"2026-05-18T01:20:50Z","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":"f8764bd662368189535ebe860ae0e72ff5df282bf8ca962492ead309621a37a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-14T06:36:17Z","title_canon_sha256":"547e9ce882df305a69d3110e7a4e0b2446ae6a38fa68266251e7a50d8516d4d4"},"schema_version":"1.0","source":{"id":"1602.04421","kind":"arxiv","version":1}},"canonical_sha256":"f6e6b99aeb764aecd69f11bc03172701e3bd28a87910daa1533bc3c597772e81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6e6b99aeb764aecd69f11bc03172701e3bd28a87910daa1533bc3c597772e81","first_computed_at":"2026-05-18T01:20:50.946213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.946213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJ64I+gZe2UWIMrtjIHemdD+FVHngSnyF8PvaCyBj39pF9Schx34cvqF7i5cc4YtKz3+BpS8QuzBwqC3b6BmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.946754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a3776420c33b34793b46aca04a9f6c9da1ce3e51b36881adeb939f023e5e6a2","sha256:7caea13792faa41f83cd2b6d9bc840c77b67c7284294f709ff81eba6750ddab9"],"state_sha256":"11ceb9ff67a9990a04a7a70d157746404f2d8a831dcd3a32fb5881bc3f00acd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpUeKh4/prY+hsJnZSsT1jAPR7ywo7uiVzxvpbJVyy5uxVieDwyJ2Kr5+hciUNgagB5ToGEfDE2Z5/yWG30YBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:46:58.629043Z","bundle_sha256":"8127f557237cd692c49a978f0c6a0bfc76721c2d1fd9b2b7b54addc85a52e52c"}}