{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5SJFXJ5UF2DT2OJK3ZLFN3A2G6","short_pith_number":"pith:5SJFXJ5U","schema_version":"1.0","canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","source":{"kind":"arxiv","id":"2606.02992","version":1},"attestation_state":"computed","paper":{"title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dongfang Zhao, Shubing Yang","submitted_at":"2026-06-02T00:59:39Z","abstract_excerpt":"Graph indexes are widely used for high-recall approximate nearest neighbor search (ANNS), but many real-time applications require streaming ANNS. In these real-time applications, continuously arriving embeddings must search the existing graph for candidate neighbors before updating graph edges, which makes repeated index construction a bottleneck for streaming ingestion workloads. We propose Slipstream, a new method that significantly reduces the computational cost of frequent insertions in graph indexes for ANNS. The core idea of Slipstream is exploiting the continuity in vector streams: the "},"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":"2606.02992","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-02T00:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"b69baeb9a09761af6829be5ef1d1327cd7315d960c8407d97b44cc7e0978714c","abstract_canon_sha256":"e984844a63e0411ef87a3db64415a308a9f58e602fdfcb473ec43cc59e1bc963"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:28.719386Z","signature_b64":"pNhdiugp5Qa/StlPcrVaU+/BcWqEHnyMfTmg3XYltkRsY9ttTDJRSh0gnQTujHZXorARm+TRpn2G+f812OfUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","last_reissued_at":"2026-06-03T01:05:28.718867Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:28.718867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dongfang Zhao, Shubing Yang","submitted_at":"2026-06-02T00:59:39Z","abstract_excerpt":"Graph indexes are widely used for high-recall approximate nearest neighbor search (ANNS), but many real-time applications require streaming ANNS. In these real-time applications, continuously arriving embeddings must search the existing graph for candidate neighbors before updating graph edges, which makes repeated index construction a bottleneck for streaming ingestion workloads. We propose Slipstream, a new method that significantly reduces the computational cost of frequent insertions in graph indexes for ANNS. The core idea of Slipstream is exploiting the continuity in vector streams: the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02992","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/2606.02992/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":"2606.02992","created_at":"2026-06-03T01:05:28.718945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02992v1","created_at":"2026-06-03T01:05:28.718945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02992","created_at":"2026-06-03T01:05:28.718945+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SJFXJ5UF2DT","created_at":"2026-06-03T01:05:28.718945+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SJFXJ5UF2DT2OJK","created_at":"2026-06-03T01:05:28.718945+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SJFXJ5U","created_at":"2026-06-03T01:05:28.718945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6","json":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6.json","graph_json":"https://pith.science/api/pith-number/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/graph.json","events_json":"https://pith.science/api/pith-number/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/events.json","paper":"https://pith.science/paper/5SJFXJ5U"},"agent_actions":{"view_html":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6","download_json":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6.json","view_paper":"https://pith.science/paper/5SJFXJ5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02992&json=true","fetch_graph":"https://pith.science/api/pith-number/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/graph.json","fetch_events":"https://pith.science/api/pith-number/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/action/storage_attestation","attest_author":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/action/author_attestation","sign_citation":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/action/citation_signature","submit_replication":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/action/replication_record"}},"created_at":"2026-06-03T01:05:28.718945+00:00","updated_at":"2026-06-03T01:05:28.718945+00:00"}