{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5SJFXJ5UF2DT2OJK3ZLFN3A2G6","short_pith_number":"pith:5SJFXJ5U","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"},"canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","source":{"kind":"arxiv","id":"2606.02992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02992","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02992v1","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02992","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"5SJFXJ5UF2DT","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_16","alias_value":"5SJFXJ5UF2DT2OJK","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_8","alias_value":"5SJFXJ5U","created_at":"2026-06-03T01:05:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5SJFXJ5UF2DT2OJK3ZLFN3A2G6","target":"record","payload":{"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"},"canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","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"},"source_kind":"arxiv","source_id":"2606.02992","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygLy/mXwDRL3Q6Y8FbPlCvpyKbFE9kCZrWZHGv12kzs7RLQz3c+OxDgOs6OUP06NiulP1UZhKiSe6rD7RTYZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:17:19.574805Z"},"content_sha256":"4f7acf7203d165dcd48951074d59c33cf20e95264d9d97f63f815783d5e12c06","schema_version":"1.0","event_id":"sha256:4f7acf7203d165dcd48951074d59c33cf20e95264d9d97f63f815783d5e12c06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5SJFXJ5UF2DT2OJK3ZLFN3A2G6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S368qDA7x1liTCLAmMKgDvQcwyxbYuYuCNQkg4FuZGYu9FrbhddrrSmgK3sPyXTO/5hJaY4dfslU2/9N2UZpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:17:19.575173Z"},"content_sha256":"a3cff398a29201009544286902e4d92ef6bc60ab4263a76c0776939f00ded19b","schema_version":"1.0","event_id":"sha256:a3cff398a29201009544286902e4d92ef6bc60ab4263a76c0776939f00ded19b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/bundle.json","state_url":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T13:17:19Z","links":{"resolver":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6","bundle":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/bundle.json","state":"https://pith.science/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SJFXJ5UF2DT2OJK3ZLFN3A2G6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5SJFXJ5UF2DT2OJK3ZLFN3A2G6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e984844a63e0411ef87a3db64415a308a9f58e602fdfcb473ec43cc59e1bc963","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-02T00:59:39Z","title_canon_sha256":"b69baeb9a09761af6829be5ef1d1327cd7315d960c8407d97b44cc7e0978714c"},"schema_version":"1.0","source":{"id":"2606.02992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02992","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02992v1","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02992","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"5SJFXJ5UF2DT","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_16","alias_value":"5SJFXJ5UF2DT2OJK","created_at":"2026-06-03T01:05:28Z"},{"alias_kind":"pith_short_8","alias_value":"5SJFXJ5U","created_at":"2026-06-03T01:05:28Z"}],"graph_snapshots":[{"event_id":"sha256:a3cff398a29201009544286902e4d92ef6bc60ab4263a76c0776939f00ded19b","target":"graph","created_at":"2026-06-03T01:05:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.02992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Dongfang Zhao, Shubing Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-02T00:59:39Z","title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02992","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f7acf7203d165dcd48951074d59c33cf20e95264d9d97f63f815783d5e12c06","target":"record","created_at":"2026-06-03T01:05:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e984844a63e0411ef87a3db64415a308a9f58e602fdfcb473ec43cc59e1bc963","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-02T00:59:39Z","title_canon_sha256":"b69baeb9a09761af6829be5ef1d1327cd7315d960c8407d97b44cc7e0978714c"},"schema_version":"1.0","source":{"id":"2606.02992","kind":"arxiv","version":1}},"canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec925ba7b42e873d392ade5656ec1a37accd6f5130f136c9c8bcc9f272169736","first_computed_at":"2026-06-03T01:05:28.718867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:28.718867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNhdiugp5Qa/StlPcrVaU+/BcWqEHnyMfTmg3XYltkRsY9ttTDJRSh0gnQTujHZXorARm+TRpn2G+f812OfUBg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:28.719386Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f7acf7203d165dcd48951074d59c33cf20e95264d9d97f63f815783d5e12c06","sha256:a3cff398a29201009544286902e4d92ef6bc60ab4263a76c0776939f00ded19b"],"state_sha256":"1216625d5825d6628d0baecfe7e5047e978e351daafc72e0db61fe92448e7e01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KkZTNjpxc2T9zF9IPd7wmWlvCxcEEQa1tcjYHvDjbKD7O3iXBia0DMjtLp6kTC9OQbXdUBtDPEI9ZZf8BVTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:17:19.577179Z","bundle_sha256":"27e25524cced3e15c10e27f927aba4f578c36e9879dfa04a2d7a6f1cf8b80770"}}