{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3YONDHWLOHAEEXHZOSIQZBOCRS","short_pith_number":"pith:3YONDHWL","schema_version":"1.0","canonical_sha256":"de1cd19ecb71c0425cf974910c85c28ca6899d463a7ef272b6cc88808bcc7517","source":{"kind":"arxiv","id":"2101.12631","version":2},"attestation_state":"computed","paper":{"title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Mengzhao Wang, Qiang Yue, Xiaoliang Xu, Yuxiang Wang","submitted_at":"2021-01-29T15:12:35Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) constitutes an important operation in a multitude of applications, including recommendation systems, information retrieval, and pattern recognition. In the past decade, graph-based ANNS algorithms have been the leading paradigm in this domain, with dozens of graph-based ANNS algorithms proposed. Such algorithms aim to provide effective, efficient solutions for retrieving the nearest neighbors for a given query. Nevertheless, these efforts focus on developing and optimizing algorithms with different approaches, so there is a real need for a comprehensi"},"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":"2101.12631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-01-29T15:12:35Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"f3892b7deb7bfe383834ef961ea74698fe1cff3576b72fbc7eb42281dd091df7","abstract_canon_sha256":"3631256982824a5f728d44304faabccfee9785c32a8cdf4886768aa3e592c1d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:53.627567Z","signature_b64":"Srm0jCjSHMURbJbY+Bz9GxF9w2GTQ5u3X/kb5hd4kas49KEqz/V7e2QjR6GJbrxa+obvVFtyrPSD89aIrlJpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1cd19ecb71c0425cf974910c85c28ca6899d463a7ef272b6cc88808bcc7517","last_reissued_at":"2026-07-05T02:38:53.627055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:53.627055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Mengzhao Wang, Qiang Yue, Xiaoliang Xu, Yuxiang Wang","submitted_at":"2021-01-29T15:12:35Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) constitutes an important operation in a multitude of applications, including recommendation systems, information retrieval, and pattern recognition. In the past decade, graph-based ANNS algorithms have been the leading paradigm in this domain, with dozens of graph-based ANNS algorithms proposed. Such algorithms aim to provide effective, efficient solutions for retrieving the nearest neighbors for a given query. Nevertheless, these efforts focus on developing and optimizing algorithms with different approaches, so there is a real need for a comprehensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.12631","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.12631/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.12631","created_at":"2026-07-05T02:38:53.627114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.12631v2","created_at":"2026-07-05T02:38:53.627114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.12631","created_at":"2026-07-05T02:38:53.627114+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YONDHWLOHAE","created_at":"2026-07-05T02:38:53.627114+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YONDHWLOHAEEXHZ","created_at":"2026-07-05T02:38:53.627114+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YONDHWL","created_at":"2026-07-05T02:38:53.627114+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11789","citing_title":"Efficient Graph Indexing for Interval-Aware Vector Search","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02992","citing_title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00768","citing_title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27066","citing_title":"Large Language Model-Powered Query-Driven Event Timeline Summarization in Industrial Search","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00734","citing_title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02171","citing_title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14343","citing_title":"Nearest-Neighbor Radii under Dependent Sampling","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02171","citing_title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10135","citing_title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2401.08281","citing_title":"The Faiss library","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS","json":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS.json","graph_json":"https://pith.science/api/pith-number/3YONDHWLOHAEEXHZOSIQZBOCRS/graph.json","events_json":"https://pith.science/api/pith-number/3YONDHWLOHAEEXHZOSIQZBOCRS/events.json","paper":"https://pith.science/paper/3YONDHWL"},"agent_actions":{"view_html":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS","download_json":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS.json","view_paper":"https://pith.science/paper/3YONDHWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.12631&json=true","fetch_graph":"https://pith.science/api/pith-number/3YONDHWLOHAEEXHZOSIQZBOCRS/graph.json","fetch_events":"https://pith.science/api/pith-number/3YONDHWLOHAEEXHZOSIQZBOCRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS/action/storage_attestation","attest_author":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS/action/author_attestation","sign_citation":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS/action/citation_signature","submit_replication":"https://pith.science/pith/3YONDHWLOHAEEXHZOSIQZBOCRS/action/replication_record"}},"created_at":"2026-07-05T02:38:53.627114+00:00","updated_at":"2026-07-05T02:38:53.627114+00:00"}