{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BJG45WGCW3ZYW4CZGRTF7Q6FED","short_pith_number":"pith:BJG45WGC","schema_version":"1.0","canonical_sha256":"0a4dced8c2b6f38b705934665fc3c520f8c9968e42739779cb801425106c2984","source":{"kind":"arxiv","id":"2605.19335","version":1},"attestation_state":"computed","paper":{"title":"Leveraging I/O Stalls for Efficient Scheduling in ANNS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Juncheng Zhang, Patrick P.C. Lee, Yongkun Li, Yuanming Ren","submitted_at":"2026-05-19T04:19:11Z","abstract_excerpt":"Disk-based graph indexes for approximate nearest neighbor search (ANNS) must serve latency-sensitive queries and throughput-demanding updates concurrently. We observe that over 40% of search-thread CPU time is spent stalling on disk I/O; such idle cycles are invisible to thread-level scheduling yet available for other work. We present LIOS(Leverage I/O Stall), a framework that executes index updates inside search-side I/O stall windows. LIOS introduces three techniques: (i) splitting each update into resumable subtasks small enough to fit within a single stall window; (ii) bounding the expecte"},"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":"2605.19335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-19T04:19:11Z","cross_cats_sorted":[],"title_canon_sha256":"97c443025d0bee8ea496016f9e5049a40e450b3188c1af55843fcd0f8e2a7e1b","abstract_canon_sha256":"77782e8ea9d648f04a0703800dbe88acb445e1b23de82b86ec45cfb65373c1e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:39.969235Z","signature_b64":"HR5xjc6b8j7oPQBWKkZNlKYJpm9o8zyuvbvRYjjqOQTpxNJQPIWo4gl7RFHmynQimWnWzStZrLOaYWO8/Yp4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4dced8c2b6f38b705934665fc3c520f8c9968e42739779cb801425106c2984","last_reissued_at":"2026-05-20T01:05:39.968788Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:39.968788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging I/O Stalls for Efficient Scheduling in ANNS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Juncheng Zhang, Patrick P.C. Lee, Yongkun Li, Yuanming Ren","submitted_at":"2026-05-19T04:19:11Z","abstract_excerpt":"Disk-based graph indexes for approximate nearest neighbor search (ANNS) must serve latency-sensitive queries and throughput-demanding updates concurrently. We observe that over 40% of search-thread CPU time is spent stalling on disk I/O; such idle cycles are invisible to thread-level scheduling yet available for other work. We present LIOS(Leverage I/O Stall), a framework that executes index updates inside search-side I/O stall windows. LIOS introduces three techniques: (i) splitting each update into resumable subtasks small enough to fit within a single stall window; (ii) bounding the expecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19335","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/2605.19335/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":"2605.19335","created_at":"2026-05-20T01:05:39.968850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19335v1","created_at":"2026-05-20T01:05:39.968850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19335","created_at":"2026-05-20T01:05:39.968850+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJG45WGCW3ZY","created_at":"2026-05-20T01:05:39.968850+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJG45WGCW3ZYW4CZ","created_at":"2026-05-20T01:05:39.968850+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJG45WGC","created_at":"2026-05-20T01:05:39.968850+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/BJG45WGCW3ZYW4CZGRTF7Q6FED","json":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED.json","graph_json":"https://pith.science/api/pith-number/BJG45WGCW3ZYW4CZGRTF7Q6FED/graph.json","events_json":"https://pith.science/api/pith-number/BJG45WGCW3ZYW4CZGRTF7Q6FED/events.json","paper":"https://pith.science/paper/BJG45WGC"},"agent_actions":{"view_html":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED","download_json":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED.json","view_paper":"https://pith.science/paper/BJG45WGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19335&json=true","fetch_graph":"https://pith.science/api/pith-number/BJG45WGCW3ZYW4CZGRTF7Q6FED/graph.json","fetch_events":"https://pith.science/api/pith-number/BJG45WGCW3ZYW4CZGRTF7Q6FED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED/action/storage_attestation","attest_author":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED/action/author_attestation","sign_citation":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED/action/citation_signature","submit_replication":"https://pith.science/pith/BJG45WGCW3ZYW4CZGRTF7Q6FED/action/replication_record"}},"created_at":"2026-05-20T01:05:39.968850+00:00","updated_at":"2026-05-20T01:05:39.968850+00:00"}