{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CPRFYVEGPB3LHU3ZINFO7VGHES","short_pith_number":"pith:CPRFYVEG","schema_version":"1.0","canonical_sha256":"13e25c54867876b3d379434aefd4c724833e903edbefb5548a14641f808a0364","source":{"kind":"arxiv","id":"1609.07228","version":3},"attestation_state":"computed","paper":{"title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cong Fu, Deng Cai","submitted_at":"2016-09-23T04:34:54Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of data mining, machine learning and computer vision. The performance of traditional hierarchical structure (tree) based methods decreases as the dimensionality of data grows, while hashing based methods usually lack efficiency in practice. Recently, the graph based methods have drawn considerable attention. The main idea is that \\emph{a neighbor of a neighbor is also likely to be a neighbor}, which we refer as \\emph{NN-expansion}. These methods construct a $k$-nearest neighbor ($k$NN) graph offline. And at online"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.07228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-09-23T04:34:54Z","cross_cats_sorted":[],"title_canon_sha256":"16082c7612f28940396e3c8ce0a73df2a6d36ef23239b00c96c892f9d5587e23","abstract_canon_sha256":"4dc73d336b45caa439dce97eb91be045c2a0a7f733bb9a807ec7ad2dd1fa3178"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:57.590208Z","signature_b64":"LIWgH0g+PmrkLJ3utaFQpJXk6NlG0hBsyg7Nsk2NrpLaHFBcepdgbcc7SgqaJm5RyZSS6Q9cKZigmKgla5vJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e25c54867876b3d379434aefd4c724833e903edbefb5548a14641f808a0364","last_reissued_at":"2026-05-18T00:55:57.589816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:57.589816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cong Fu, Deng Cai","submitted_at":"2016-09-23T04:34:54Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of data mining, machine learning and computer vision. The performance of traditional hierarchical structure (tree) based methods decreases as the dimensionality of data grows, while hashing based methods usually lack efficiency in practice. Recently, the graph based methods have drawn considerable attention. The main idea is that \\emph{a neighbor of a neighbor is also likely to be a neighbor}, which we refer as \\emph{NN-expansion}. These methods construct a $k$-nearest neighbor ($k$NN) graph offline. And at online"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07228","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.07228","created_at":"2026-05-18T00:55:57.589872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07228v3","created_at":"2026-05-18T00:55:57.589872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07228","created_at":"2026-05-18T00:55:57.589872+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPRFYVEGPB3L","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPRFYVEGPB3LHU3Z","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPRFYVEG","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.23342","citing_title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10135","citing_title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22171","citing_title":"MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES","json":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES.json","graph_json":"https://pith.science/api/pith-number/CPRFYVEGPB3LHU3ZINFO7VGHES/graph.json","events_json":"https://pith.science/api/pith-number/CPRFYVEGPB3LHU3ZINFO7VGHES/events.json","paper":"https://pith.science/paper/CPRFYVEG"},"agent_actions":{"view_html":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES","download_json":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES.json","view_paper":"https://pith.science/paper/CPRFYVEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07228&json=true","fetch_graph":"https://pith.science/api/pith-number/CPRFYVEGPB3LHU3ZINFO7VGHES/graph.json","fetch_events":"https://pith.science/api/pith-number/CPRFYVEGPB3LHU3ZINFO7VGHES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/action/storage_attestation","attest_author":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/action/author_attestation","sign_citation":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/action/citation_signature","submit_replication":"https://pith.science/pith/CPRFYVEGPB3LHU3ZINFO7VGHES/action/replication_record"}},"created_at":"2026-05-18T00:55:57.589872+00:00","updated_at":"2026-05-18T00:55:57.589872+00:00"}