{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IUXWHQSNKNGR4RJ636U2UTRFLV","short_pith_number":"pith:IUXWHQSN","schema_version":"1.0","canonical_sha256":"452f63c24d534d1e453edfa9aa4e255d7ad09651d86271210f2076a4d3b22c7b","source":{"kind":"arxiv","id":"2507.06653","version":1},"attestation_state":"computed","paper":{"title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Baotong Lu, Hui Li, James Cheng, Meng Chen, Qianxi Zhang, Qi Chen, Xiangyu Zhi, Xiao Yan","submitted_at":"2025-07-09T08:36:20Z","abstract_excerpt":"Similarity-based vector search facilitates many important applications such as search and recommendation but is limited by the memory capacity and bandwidth of a single machine due to large datasets and intensive data read. In this paper, we present CoTra, a system that scales up vector search for distributed execution. We observe a tension between computation and communication efficiency, which is the main challenge for good scalability, i.e., handling the local vectors on each machine independently blows up computation as the pruning power of vector index is not fully utilized, while running"},"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":"2507.06653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-07-09T08:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"94e6031a03ebb67933d3981f537a83e0d1170eefb12734ff9b6aee96be92deaf","abstract_canon_sha256":"b0e3c525a93ce0ed97d1675ed4120c4a86f822d1d596c5abbd2a31e16f124ac9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:20.472068Z","signature_b64":"yU5U8fwyxcgeH6bwmCmjI7c9+wq6cFqKk1TVu7sQyuUKVfxnQ7fWSQ0HAAfbqhvwBL+St1w7XeEa8fOdSU5iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452f63c24d534d1e453edfa9aa4e255d7ad09651d86271210f2076a4d3b22c7b","last_reissued_at":"2026-07-05T11:34:20.471573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:20.471573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Baotong Lu, Hui Li, James Cheng, Meng Chen, Qianxi Zhang, Qi Chen, Xiangyu Zhi, Xiao Yan","submitted_at":"2025-07-09T08:36:20Z","abstract_excerpt":"Similarity-based vector search facilitates many important applications such as search and recommendation but is limited by the memory capacity and bandwidth of a single machine due to large datasets and intensive data read. In this paper, we present CoTra, a system that scales up vector search for distributed execution. We observe a tension between computation and communication efficiency, which is the main challenge for good scalability, i.e., handling the local vectors on each machine independently blows up computation as the pruning power of vector index is not fully utilized, while running"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06653","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/2507.06653/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":"2507.06653","created_at":"2026-07-05T11:34:20.471631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06653v1","created_at":"2026-07-05T11:34:20.471631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06653","created_at":"2026-07-05T11:34:20.471631+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUXWHQSNKNGR","created_at":"2026-07-05T11:34:20.471631+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUXWHQSNKNGR4RJ6","created_at":"2026-07-05T11:34:20.471631+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUXWHQSN","created_at":"2026-07-05T11:34:20.471631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08950","citing_title":"When More Cores Hurts: The Vector Database Scaling Paradox in HPC","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02784","citing_title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2512.09331","citing_title":"Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV","json":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV.json","graph_json":"https://pith.science/api/pith-number/IUXWHQSNKNGR4RJ636U2UTRFLV/graph.json","events_json":"https://pith.science/api/pith-number/IUXWHQSNKNGR4RJ636U2UTRFLV/events.json","paper":"https://pith.science/paper/IUXWHQSN"},"agent_actions":{"view_html":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV","download_json":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV.json","view_paper":"https://pith.science/paper/IUXWHQSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06653&json=true","fetch_graph":"https://pith.science/api/pith-number/IUXWHQSNKNGR4RJ636U2UTRFLV/graph.json","fetch_events":"https://pith.science/api/pith-number/IUXWHQSNKNGR4RJ636U2UTRFLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV/action/storage_attestation","attest_author":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV/action/author_attestation","sign_citation":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV/action/citation_signature","submit_replication":"https://pith.science/pith/IUXWHQSNKNGR4RJ636U2UTRFLV/action/replication_record"}},"created_at":"2026-07-05T11:34:20.471631+00:00","updated_at":"2026-07-05T11:34:20.471631+00:00"}