{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6H6KVS7TKA7OXXXVCUB2DEUQXK","short_pith_number":"pith:6H6KVS7T","schema_version":"1.0","canonical_sha256":"f1fcaacbf3503eebdef51503a19290ba9b4221820e6a76b55061019e1ce8daa6","source":{"kind":"arxiv","id":"2411.00970","version":1},"attestation_state":"computed","paper":{"title":"Incremental IVF Index Maintenance for Streaming Vector Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Anil Pacaci, Cedric Renggli, Ihab F. Ilyas, Jason Mohoney, Jeffery Pound, Nima Reyhani, Shihabur Rahman Chowdhury, Shivaram Venkataraman, Theodoros Rekatsinas, Umar Farooq Minhas","submitted_at":"2024-11-01T18:43:45Z","abstract_excerpt":"The prevalence of vector similarity search in modern machine learning applications and the continuously changing nature of data processed by these applications necessitate efficient and effective index maintenance techniques for vector search indexes. Designed primarily for static workloads, existing vector search indexes degrade in search quality and performance as the underlying data is updated unless costly index reconstruction is performed. To address this, we introduce Ada-IVF, an incremental indexing methodology for Inverted File (IVF) indexes. Ada-IVF consists of 1) an adaptive maintena"},"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":"2411.00970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-01T18:43:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f20d9c169891fc72d876f88a843d4357daf877a703056d8fc13778b960569611","abstract_canon_sha256":"d2730514f4e51fc8710b5030f4dd1457536ff8afd73c5a832f7710f3cddf14e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:53.202258Z","signature_b64":"NuX/cg9nSbq3e25mdjY+m5cboD/CGzDw7xXRYUbSBH0vMUysdIFSOuzQrAr9pL8xhH92IsNgGc6fF+VpHKtzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1fcaacbf3503eebdef51503a19290ba9b4221820e6a76b55061019e1ce8daa6","last_reissued_at":"2026-07-05T09:29:53.201806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:53.201806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental IVF Index Maintenance for Streaming Vector Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Anil Pacaci, Cedric Renggli, Ihab F. Ilyas, Jason Mohoney, Jeffery Pound, Nima Reyhani, Shihabur Rahman Chowdhury, Shivaram Venkataraman, Theodoros Rekatsinas, Umar Farooq Minhas","submitted_at":"2024-11-01T18:43:45Z","abstract_excerpt":"The prevalence of vector similarity search in modern machine learning applications and the continuously changing nature of data processed by these applications necessitate efficient and effective index maintenance techniques for vector search indexes. Designed primarily for static workloads, existing vector search indexes degrade in search quality and performance as the underlying data is updated unless costly index reconstruction is performed. To address this, we introduce Ada-IVF, an incremental indexing methodology for Inverted File (IVF) indexes. Ada-IVF consists of 1) an adaptive maintena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00970","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/2411.00970/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":"2411.00970","created_at":"2026-07-05T09:29:53.201862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00970v1","created_at":"2026-07-05T09:29:53.201862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00970","created_at":"2026-07-05T09:29:53.201862+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H6KVS7TKA7O","created_at":"2026-07-05T09:29:53.201862+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H6KVS7TKA7OXXXV","created_at":"2026-07-05T09:29:53.201862+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H6KVS7T","created_at":"2026-07-05T09:29:53.201862+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03151","citing_title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00728","citing_title":"When to Repair a Graph ANN Index: A Matched-Budget Negative Result, and the Interpolated-Baseline Trap That Hid It","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29968","citing_title":"CLIP: Lightweight Cosine-Law-Based Inverted-List Pruning for IVF-Based Vector Search","ref_index":34,"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":20,"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":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02801","citing_title":"Distance Comparison Operations Are Not Silver Bullets in Vector Similarity Search: A Benchmark Study on Their Merits and Limits","ref_index":43,"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":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK","json":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK.json","graph_json":"https://pith.science/api/pith-number/6H6KVS7TKA7OXXXVCUB2DEUQXK/graph.json","events_json":"https://pith.science/api/pith-number/6H6KVS7TKA7OXXXVCUB2DEUQXK/events.json","paper":"https://pith.science/paper/6H6KVS7T"},"agent_actions":{"view_html":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK","download_json":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK.json","view_paper":"https://pith.science/paper/6H6KVS7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00970&json=true","fetch_graph":"https://pith.science/api/pith-number/6H6KVS7TKA7OXXXVCUB2DEUQXK/graph.json","fetch_events":"https://pith.science/api/pith-number/6H6KVS7TKA7OXXXVCUB2DEUQXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK/action/storage_attestation","attest_author":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK/action/author_attestation","sign_citation":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK/action/citation_signature","submit_replication":"https://pith.science/pith/6H6KVS7TKA7OXXXVCUB2DEUQXK/action/replication_record"}},"created_at":"2026-07-05T09:29:53.201862+00:00","updated_at":"2026-07-05T09:29:53.201862+00:00"}