{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UMOGZMQ2FLU6MGTSKTMYC5OOQR","short_pith_number":"pith:UMOGZMQ2","canonical_record":{"source":{"id":"1610.02455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-08T00:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"224c4b962b532bd3243af949d913def9da05e5452bcee517d6ae5cd51b05ae4b","abstract_canon_sha256":"82157c5c397ede9224cc61c53694eeab29a74258cf8db0dcbff5032bb75004fa"},"schema_version":"1.0"},"canonical_sha256":"a31c6cb21a2ae9e61a7254d98175ce847407758dfb258ababc4ea1dccf250263","source":{"kind":"arxiv","id":"1610.02455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02455","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02455v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02455","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"UMOGZMQ2FLU6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMOGZMQ2FLU6MGTS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMOGZMQ2","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UMOGZMQ2FLU6MGTSKTMYC5OOQR","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-08T00:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"224c4b962b532bd3243af949d913def9da05e5452bcee517d6ae5cd51b05ae4b","abstract_canon_sha256":"82157c5c397ede9224cc61c53694eeab29a74258cf8db0dcbff5032bb75004fa"},"schema_version":"1.0"},"canonical_sha256":"a31c6cb21a2ae9e61a7254d98175ce847407758dfb258ababc4ea1dccf250263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.459192Z","signature_b64":"bj0ZnW6xzVNUpy1w1lYAKAPh7ft+ZrP0qSmlWlZbODHTsfkWGIZocLsRktrpcx8Qu80ogB2P3AJXIAfCuucsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31c6cb21a2ae9e61a7254d98175ce847407758dfb258ababc4ea1dccf250263","last_reissued_at":"2026-05-18T01:02:51.458783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.458783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02455","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:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3ZoufCd36Sd3bRpLjnHKSWQkqjGzbI0odMATE9HlV1c70VxXI/9JRzYPWuN9AmZ1pvdVP3b1eIEClNEIquIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:39:30.511412Z"},"content_sha256":"491dded4182d736542ca8a154a7d345769f634d1ffa107b1fd1da199dc04436e","schema_version":"1.0","event_id":"sha256:491dded4182d736542ca8a154a7d345769f634d1ffa107b1fd1da199dc04436e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UMOGZMQ2FLU6MGTSKTMYC5OOQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Wei Wang, Wenjie Zhang, Wen Li, Xuemin Lin, Yifang Sun, Ying Zhang","submitted_at":"2016-10-08T00:40:14Z","abstract_excerpt":"Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications from many domains, such as databases, machine learning, multimedia, and computer vision. Although many algorithms have been continuously proposed in the literature in the above domains each year, there is no comprehensive evaluation and analysis of their performances.\n  In this paper, we conduct a comprehensive experimental evaluation of many state-of-the-art methods for approximate nearest neighbor search. Our study (1) is cross-disciplinary (i.e., including 16 algorithms in different domains, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02455","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:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9N6Zk9nxuvrqIxkw+BfolN/JQtPe9k9ebezOjSGaUoukxa89HfpAqGcwUZ8456QpgTC0KmcFfwnRgKFRjL9yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:39:30.511764Z"},"content_sha256":"ba472d8a622cbe28b86e5266ee306a1638b65f418f9b35fe3fc703c342a9e2e6","schema_version":"1.0","event_id":"sha256:ba472d8a622cbe28b86e5266ee306a1638b65f418f9b35fe3fc703c342a9e2e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/bundle.json","state_url":"https://pith.science/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/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-28T09:39:30Z","links":{"resolver":"https://pith.science/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR","bundle":"https://pith.science/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/bundle.json","state":"https://pith.science/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMOGZMQ2FLU6MGTSKTMYC5OOQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UMOGZMQ2FLU6MGTSKTMYC5OOQR","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":"82157c5c397ede9224cc61c53694eeab29a74258cf8db0dcbff5032bb75004fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-08T00:40:14Z","title_canon_sha256":"224c4b962b532bd3243af949d913def9da05e5452bcee517d6ae5cd51b05ae4b"},"schema_version":"1.0","source":{"id":"1610.02455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02455","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02455v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02455","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"UMOGZMQ2FLU6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMOGZMQ2FLU6MGTS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMOGZMQ2","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ba472d8a622cbe28b86e5266ee306a1638b65f418f9b35fe3fc703c342a9e2e6","target":"graph","created_at":"2026-05-18T01:02: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":"Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications from many domains, such as databases, machine learning, multimedia, and computer vision. Although many algorithms have been continuously proposed in the literature in the above domains each year, there is no comprehensive evaluation and analysis of their performances.\n  In this paper, we conduct a comprehensive experimental evaluation of many state-of-the-art methods for approximate nearest neighbor search. Our study (1) is cross-disciplinary (i.e., including 16 algorithms in different domains, an","authors_text":"Wei Wang, Wenjie Zhang, Wen Li, Xuemin Lin, Yifang Sun, Ying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-08T00:40:14Z","title":"Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02455","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:491dded4182d736542ca8a154a7d345769f634d1ffa107b1fd1da199dc04436e","target":"record","created_at":"2026-05-18T01:02: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":"82157c5c397ede9224cc61c53694eeab29a74258cf8db0dcbff5032bb75004fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-08T00:40:14Z","title_canon_sha256":"224c4b962b532bd3243af949d913def9da05e5452bcee517d6ae5cd51b05ae4b"},"schema_version":"1.0","source":{"id":"1610.02455","kind":"arxiv","version":1}},"canonical_sha256":"a31c6cb21a2ae9e61a7254d98175ce847407758dfb258ababc4ea1dccf250263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a31c6cb21a2ae9e61a7254d98175ce847407758dfb258ababc4ea1dccf250263","first_computed_at":"2026-05-18T01:02:51.458783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:51.458783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bj0ZnW6xzVNUpy1w1lYAKAPh7ft+ZrP0qSmlWlZbODHTsfkWGIZocLsRktrpcx8Qu80ogB2P3AJXIAfCuucsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:51.459192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:491dded4182d736542ca8a154a7d345769f634d1ffa107b1fd1da199dc04436e","sha256:ba472d8a622cbe28b86e5266ee306a1638b65f418f9b35fe3fc703c342a9e2e6"],"state_sha256":"9afb4598ec039f3bcc70c1bd05c9c4f784c886962c248e6ae4a70d9f850d2789"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTEleT5eNeHgCRl2lLNyvOsMxqpDBl3EMstoqRjX1x+X/4mNrAwHEeaFvaSiA+xj7XYi1UKPbaqZBDywx1eaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:39:30.513728Z","bundle_sha256":"a28b6a00919a1678deb0bc28f56fae1a37afe19bba2f39d984945862ec24eccb"}}