{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U2T3RZ5R6M43ZBDONS2SF5BJHZ","short_pith_number":"pith:U2T3RZ5R","schema_version":"1.0","canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","source":{"kind":"arxiv","id":"2505.11783","version":1},"attestation_state":"computed","paper":{"title":"Efficient Vector Search on Disaggregated Memory with d-HNSW","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Qian, Fei Fang, Yi Liu","submitted_at":"2025-05-17T01:31:21Z","abstract_excerpt":"Efficient vector query processing is critical to enable AI applications at scale. Recent solutions struggle with growing vector datasets that exceed single-machine memory capacity, forcing unnecessary data movement and resource underutilization in monolithic architectures. We present d-HNSW, the first disaggregated vector similarity search engine for RDMA-based remote memory systems that achieves high performance while supporting fast data indexing with low network communication overhead. The core of d-HNSW is a novel disaggregation of the graph-based vector indexing data structure HNSW. It ex"},"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":"2505.11783","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-05-17T01:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"b9d7383d3ea3eadcfce6f79c2f621f37a626169e3913917ae9c2fa10fe377dba","abstract_canon_sha256":"4348457fefba693802c599ccb30ef92b8d6f2aa5463e9bd6b8cd32de72774a34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:26.595431Z","signature_b64":"rcYQfRkvnzEOTCFWQiGTE9OzRKbOZ36iEls6JUzRTH8EN6McRWMFoWLC7UUHkYwARh1l9RqHD0i/c2Kg9oIbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","last_reissued_at":"2026-07-05T11:04:26.594902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:26.594902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Vector Search on Disaggregated Memory with d-HNSW","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Qian, Fei Fang, Yi Liu","submitted_at":"2025-05-17T01:31:21Z","abstract_excerpt":"Efficient vector query processing is critical to enable AI applications at scale. Recent solutions struggle with growing vector datasets that exceed single-machine memory capacity, forcing unnecessary data movement and resource underutilization in monolithic architectures. We present d-HNSW, the first disaggregated vector similarity search engine for RDMA-based remote memory systems that achieves high performance while supporting fast data indexing with low network communication overhead. The core of d-HNSW is a novel disaggregation of the graph-based vector indexing data structure HNSW. It ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11783","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/2505.11783/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":"2505.11783","created_at":"2026-07-05T11:04:26.594959+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.11783v1","created_at":"2026-07-05T11:04:26.594959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11783","created_at":"2026-07-05T11:04:26.594959+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2T3RZ5R6M43","created_at":"2026-07-05T11:04:26.594959+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2T3RZ5R6M43ZBDO","created_at":"2026-07-05T11:04:26.594959+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2T3RZ5R","created_at":"2026-07-05T11:04:26.594959+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/U2T3RZ5R6M43ZBDONS2SF5BJHZ","json":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ.json","graph_json":"https://pith.science/api/pith-number/U2T3RZ5R6M43ZBDONS2SF5BJHZ/graph.json","events_json":"https://pith.science/api/pith-number/U2T3RZ5R6M43ZBDONS2SF5BJHZ/events.json","paper":"https://pith.science/paper/U2T3RZ5R"},"agent_actions":{"view_html":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ","download_json":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ.json","view_paper":"https://pith.science/paper/U2T3RZ5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.11783&json=true","fetch_graph":"https://pith.science/api/pith-number/U2T3RZ5R6M43ZBDONS2SF5BJHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/U2T3RZ5R6M43ZBDONS2SF5BJHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/action/storage_attestation","attest_author":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/action/author_attestation","sign_citation":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/action/citation_signature","submit_replication":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/action/replication_record"}},"created_at":"2026-07-05T11:04:26.594959+00:00","updated_at":"2026-07-05T11:04:26.594959+00:00"}