{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EUHXF4W6GDIXBHNZ6KU366HZ5F","short_pith_number":"pith:EUHXF4W6","schema_version":"1.0","canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","source":{"kind":"arxiv","id":"1707.00143","version":10},"attestation_state":"computed","paper":{"title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changxu Wang, Chao Xiang, Cong Fu, Deng Cai","submitted_at":"2017-07-01T11:52:37Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some early graph-based approaches have shown attractive theoretical guarantees on search time complexity, but they all suffer from the problem of high indexing time complexity. Recently, some graph-based methods have been proposed to reduce indexing complexity by approximating the traditional graphs; these methods have achieved revolutionary performance on million-scale datasets. Yet, they still can not scale to billion-node datab"},"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":"1707.00143","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"a05bc977421387bad2cbbd9a57910bb3264c78db889f3f4924ce6af5ee795d4f","abstract_canon_sha256":"2ab991593f9e3877e12f34d627e23dfbe621efc63cdd3cbceebad77b6ea09ed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:10.980539Z","signature_b64":"gqqX3BMI7PHnRd0YHpN+EetXmg13PPzOYyPeY17c6TFHyTHDM/L/chtBbuB53WtJpM7DCMEPYF/5ZIlwvWEjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","last_reissued_at":"2026-07-05T11:32:10.980043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:10.980043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changxu Wang, Chao Xiang, Cong Fu, Deng Cai","submitted_at":"2017-07-01T11:52:37Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some early graph-based approaches have shown attractive theoretical guarantees on search time complexity, but they all suffer from the problem of high indexing time complexity. Recently, some graph-based methods have been proposed to reduce indexing complexity by approximating the traditional graphs; these methods have achieved revolutionary performance on million-scale datasets. Yet, they still can not scale to billion-node datab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00143","kind":"arxiv","version":10},"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/1707.00143/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":"1707.00143","created_at":"2026-07-05T11:32:10.980103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00143v10","created_at":"2026-07-05T11:32:10.980103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00143","created_at":"2026-07-05T11:32:10.980103+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUHXF4W6GDIX","created_at":"2026-07-05T11:32:10.980103+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUHXF4W6GDIXBHNZ","created_at":"2026-07-05T11:32:10.980103+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUHXF4W6","created_at":"2026-07-05T11:32:10.980103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11789","citing_title":"Efficient Graph Indexing for Interval-Aware Vector Search","ref_index":16,"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":15,"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":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02784","citing_title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29970","citing_title":"From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25522","citing_title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2504.20018","citing_title":"MINT: Multi-Vector Search Index Tuning","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2505.17152","citing_title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2602.23342","citing_title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10135","citing_title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2401.08281","citing_title":"The Faiss library","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F","json":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F.json","graph_json":"https://pith.science/api/pith-number/EUHXF4W6GDIXBHNZ6KU366HZ5F/graph.json","events_json":"https://pith.science/api/pith-number/EUHXF4W6GDIXBHNZ6KU366HZ5F/events.json","paper":"https://pith.science/paper/EUHXF4W6"},"agent_actions":{"view_html":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F","download_json":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F.json","view_paper":"https://pith.science/paper/EUHXF4W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00143&json=true","fetch_graph":"https://pith.science/api/pith-number/EUHXF4W6GDIXBHNZ6KU366HZ5F/graph.json","fetch_events":"https://pith.science/api/pith-number/EUHXF4W6GDIXBHNZ6KU366HZ5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/action/storage_attestation","attest_author":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/action/author_attestation","sign_citation":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/action/citation_signature","submit_replication":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/action/replication_record"}},"created_at":"2026-07-05T11:32:10.980103+00:00","updated_at":"2026-07-05T11:32:10.980103+00:00"}