{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DD3CJPYUKKJ5XVJHMZLVQEFCUU","short_pith_number":"pith:DD3CJPYU","schema_version":"1.0","canonical_sha256":"18f624bf145293dbd52766575810a2a52cd72818d66dfd91a242914a61134a98","source":{"kind":"arxiv","id":"2105.09613","version":1},"attestation_state":"computed","paper":{"title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aditi Singh, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Suhas Jayaram Subramanya","submitted_at":"2021-05-20T09:17:13Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in the industry. Recent advances in graph-based indices have made it possible to index and search billion-point datasets with high recall and millisecond-level latency on a single commodity machine with an SSD.\n  However, existing graph algorithms for ANNS support only static indices that cannot reflect real-time changes to the corpus required by many key real-world scenarios (e.g. index of sentences in documents, email,"},"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":"2105.09613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-05-20T09:17:13Z","cross_cats_sorted":[],"title_canon_sha256":"f564d71cd8ae493b103124054c24654878ee4d09c5bcee7224696bb4847e3001","abstract_canon_sha256":"abccfb1ba4eea325229a57abb0a3a2af307c3c47387bbd8f7b5375b79caf7088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:55.138666Z","signature_b64":"hiFzSuxPtdJSQnheQi9laAW6pdih+DWzv/tRxY54X8q5Wp0QyVyRhHzrQrmc10NGgiJZfaNrHuymqxf5cEPfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f624bf145293dbd52766575810a2a52cd72818d66dfd91a242914a61134a98","last_reissued_at":"2026-07-05T02:41:55.138224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:55.138224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aditi Singh, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Suhas Jayaram Subramanya","submitted_at":"2021-05-20T09:17:13Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in the industry. Recent advances in graph-based indices have made it possible to index and search billion-point datasets with high recall and millisecond-level latency on a single commodity machine with an SSD.\n  However, existing graph algorithms for ANNS support only static indices that cannot reflect real-time changes to the corpus required by many key real-world scenarios (e.g. index of sentences in documents, email,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.09613","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.09613/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":"2105.09613","created_at":"2026-07-05T02:41:55.138289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.09613v1","created_at":"2026-07-05T02:41:55.138289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.09613","created_at":"2026-07-05T02:41:55.138289+00:00"},{"alias_kind":"pith_short_12","alias_value":"DD3CJPYUKKJ5","created_at":"2026-07-05T02:41:55.138289+00:00"},{"alias_kind":"pith_short_16","alias_value":"DD3CJPYUKKJ5XVJH","created_at":"2026-07-05T02:41:55.138289+00:00"},{"alias_kind":"pith_short_8","alias_value":"DD3CJPYU","created_at":"2026-07-05T02:41:55.138289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":20,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25237","citing_title":"Extreme Meta-Classification for Large-Scale Zero-Shot Retrieval","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03151","citing_title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","ref_index":44,"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":60,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00728","citing_title":"When to Repair a Graph ANN Index: Navigability-Signal-Triggered Local Repair Protects Tail Recall Under Bursty Churn","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26474","citing_title":"Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]","ref_index":22,"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":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17415","citing_title":"IVF-TQ: Calibration-Free Streaming Vector Search via a Codebook-Free Residual Layer","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":67,"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":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17415","citing_title":"IVF-TQ: Calibration-Free Streaming Vector Search via a Codebook-Free Residual Layer","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19335","citing_title":"Leveraging I/O Stalls for Efficient Scheduling in ANNS","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09173","citing_title":"Decoupling Vector Data and Index Storage for Space Efficiency","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2510.25401","citing_title":"DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2512.09331","citing_title":"Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02522","citing_title":"Opal: Private Memory for Personal AI","ref_index":195,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11523","citing_title":"NAVIS: Concurrent Search and Update with Low Position-Seeking Overhead in On-SSD Graph-Based Vector Search","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10135","citing_title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11274","citing_title":"Mycelium-Index: A Streaming Approximate Nearest Neighbor Index with Myelial Edge Decay, Traffic-Driven Reinforcement, and Adaptive Living Hierarchy","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09173","citing_title":"Decoupling Vector Data and Index Storage for Space Efficiency","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20401","citing_title":"Onyx: Cost-Efficient Disk-Oblivious ANN Search","ref_index":109,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU","json":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU.json","graph_json":"https://pith.science/api/pith-number/DD3CJPYUKKJ5XVJHMZLVQEFCUU/graph.json","events_json":"https://pith.science/api/pith-number/DD3CJPYUKKJ5XVJHMZLVQEFCUU/events.json","paper":"https://pith.science/paper/DD3CJPYU"},"agent_actions":{"view_html":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU","download_json":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU.json","view_paper":"https://pith.science/paper/DD3CJPYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.09613&json=true","fetch_graph":"https://pith.science/api/pith-number/DD3CJPYUKKJ5XVJHMZLVQEFCUU/graph.json","fetch_events":"https://pith.science/api/pith-number/DD3CJPYUKKJ5XVJHMZLVQEFCUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU/action/storage_attestation","attest_author":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU/action/author_attestation","sign_citation":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU/action/citation_signature","submit_replication":"https://pith.science/pith/DD3CJPYUKKJ5XVJHMZLVQEFCUU/action/replication_record"}},"created_at":"2026-07-05T02:41:55.138289+00:00","updated_at":"2026-07-05T02:41:55.138289+00:00"}