{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E5AZ5OFEXG3Y4X6XBAM3UPIEIV","short_pith_number":"pith:E5AZ5OFE","schema_version":"1.0","canonical_sha256":"27419eb8a4b9b78e5fd70819ba3d044569f8c20d197a687b911ddaf79496a329","source":{"kind":"arxiv","id":"2508.15694","version":1},"attestation_state":"computed","paper":{"title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ge Yu, Shengyuan Lin, Shufeng Gong, Shuhao Fan, Song Yu, Yanfeng Zhang, Yijie Zhou","submitted_at":"2025-08-21T16:21:46Z","abstract_excerpt":"Graph-based high-dimensional vector indices have become a mainstream solution for large-scale approximate nearest neighbor search (ANNS). However, their substantial memory footprint often requires storage on secondary devices, where frequent on-demand loading of graph and vector data leads to I/O becoming the dominant bottleneck, accounting for over 90\\% of query latency. Existing static caching strategies mitigate this issue only in the initial navigation phase by preloading entry points and multi-hop neighbors, but they fail in the second phase where query-dependent nodes must be dynamically"},"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":"2508.15694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-08-21T16:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"b68c42367fb5a43a8352209d3342b9241ba4a65a47deb1b4c6a536f3d8ac4903","abstract_canon_sha256":"272cc9be5c0bb9bd129bc1c636156f8340ca6806799397c85cac47ed122f8e27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:17.184377Z","signature_b64":"WtMEaAveRzPcwLGsGjbawtPi18oKXNyWzLqks0KavlrgVhODmhNQmBBj2BQyxKOfxVpiGFcCjUDG0wDRwanRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27419eb8a4b9b78e5fd70819ba3d044569f8c20d197a687b911ddaf79496a329","last_reissued_at":"2026-07-05T11:57:17.183888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:17.183888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ge Yu, Shengyuan Lin, Shufeng Gong, Shuhao Fan, Song Yu, Yanfeng Zhang, Yijie Zhou","submitted_at":"2025-08-21T16:21:46Z","abstract_excerpt":"Graph-based high-dimensional vector indices have become a mainstream solution for large-scale approximate nearest neighbor search (ANNS). However, their substantial memory footprint often requires storage on secondary devices, where frequent on-demand loading of graph and vector data leads to I/O becoming the dominant bottleneck, accounting for over 90\\% of query latency. Existing static caching strategies mitigate this issue only in the initial navigation phase by preloading entry points and multi-hop neighbors, but they fail in the second phase where query-dependent nodes must be dynamically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15694","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/2508.15694/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":"2508.15694","created_at":"2026-07-05T11:57:17.183947+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15694v1","created_at":"2026-07-05T11:57:17.183947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15694","created_at":"2026-07-05T11:57:17.183947+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5AZ5OFEXG3Y","created_at":"2026-07-05T11:57:17.183947+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5AZ5OFEXG3Y4X6X","created_at":"2026-07-05T11:57:17.183947+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5AZ5OFE","created_at":"2026-07-05T11:57:17.183947+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02784","citing_title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2602.23342","citing_title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV","json":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV.json","graph_json":"https://pith.science/api/pith-number/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/graph.json","events_json":"https://pith.science/api/pith-number/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/events.json","paper":"https://pith.science/paper/E5AZ5OFE"},"agent_actions":{"view_html":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV","download_json":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV.json","view_paper":"https://pith.science/paper/E5AZ5OFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15694&json=true","fetch_graph":"https://pith.science/api/pith-number/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/graph.json","fetch_events":"https://pith.science/api/pith-number/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/action/storage_attestation","attest_author":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/action/author_attestation","sign_citation":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/action/citation_signature","submit_replication":"https://pith.science/pith/E5AZ5OFEXG3Y4X6XBAM3UPIEIV/action/replication_record"}},"created_at":"2026-07-05T11:57:17.183947+00:00","updated_at":"2026-07-05T11:57:17.183947+00:00"}