{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:U2T3RZ5R6M43ZBDONS2SF5BJHZ","short_pith_number":"pith:U2T3RZ5R","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"},"canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","source":{"kind":"arxiv","id":"2505.11783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11783","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11783v1","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11783","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"U2T3RZ5R6M43","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"U2T3RZ5R6M43ZBDO","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"U2T3RZ5R","created_at":"2026-07-05T11:04:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:U2T3RZ5R6M43ZBDONS2SF5BJHZ","target":"record","payload":{"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"},"canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","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"},"source_kind":"arxiv","source_id":"2505.11783","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-07-05T11:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy5NQZd2lhKhLqODBz34+iq12Rafk5+QToX8IKdL0utroT7H1vIJvT7kUkSJUvfINbk2esoiZkydHMUC8EcXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:50:16.450371Z"},"content_sha256":"dfd9808928e7e678d1269d11f8d20956897f0abbd4f51263d9c454b021a32f72","schema_version":"1.0","event_id":"sha256:dfd9808928e7e678d1269d11f8d20956897f0abbd4f51263d9c454b021a32f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:U2T3RZ5R6M43ZBDONS2SF5BJHZ","target":"graph","payload":{"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"},"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-07-05T11:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaKGyaWusEXDMBWluvqxaraOctHE/PqJMr6X5uCuyd6lqkSK2+eIGZTuYz99YPLinBx2EOv5rEuI/OE45Xw8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:50:16.450869Z"},"content_sha256":"f4740843be98d479ed5066d875ac8a951119da55e7567471a5fc0ed054fb2b6a","schema_version":"1.0","event_id":"sha256:f4740843be98d479ed5066d875ac8a951119da55e7567471a5fc0ed054fb2b6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/bundle.json","state_url":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/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-08-21T17:50:16Z","links":{"resolver":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ","bundle":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/bundle.json","state":"https://pith.science/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2T3RZ5R6M43ZBDONS2SF5BJHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:U2T3RZ5R6M43ZBDONS2SF5BJHZ","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":"4348457fefba693802c599ccb30ef92b8d6f2aa5463e9bd6b8cd32de72774a34","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-05-17T01:31:21Z","title_canon_sha256":"b9d7383d3ea3eadcfce6f79c2f621f37a626169e3913917ae9c2fa10fe377dba"},"schema_version":"1.0","source":{"id":"2505.11783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11783","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11783v1","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11783","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"U2T3RZ5R6M43","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"U2T3RZ5R6M43ZBDO","created_at":"2026-07-05T11:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"U2T3RZ5R","created_at":"2026-07-05T11:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:f4740843be98d479ed5066d875ac8a951119da55e7567471a5fc0ed054fb2b6a","target":"graph","created_at":"2026-07-05T11:04:26Z","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/2505.11783/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chen Qian, Fei Fang, Yi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-05-17T01:31:21Z","title":"Efficient Vector Search on Disaggregated Memory with d-HNSW"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11783","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:dfd9808928e7e678d1269d11f8d20956897f0abbd4f51263d9c454b021a32f72","target":"record","created_at":"2026-07-05T11:04:26Z","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":"4348457fefba693802c599ccb30ef92b8d6f2aa5463e9bd6b8cd32de72774a34","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-05-17T01:31:21Z","title_canon_sha256":"b9d7383d3ea3eadcfce6f79c2f621f37a626169e3913917ae9c2fa10fe377dba"},"schema_version":"1.0","source":{"id":"2505.11783","kind":"arxiv","version":1}},"canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6a7b8e7b1f339bc846e6cb522f4293e671004c9aa2e3b159ff4569b3222a13d","first_computed_at":"2026-07-05T11:04:26.594902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:26.594902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcYQfRkvnzEOTCFWQiGTE9OzRKbOZ36iEls6JUzRTH8EN6McRWMFoWLC7UUHkYwARh1l9RqHD0i/c2Kg9oIbCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:26.595431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.11783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfd9808928e7e678d1269d11f8d20956897f0abbd4f51263d9c454b021a32f72","sha256:f4740843be98d479ed5066d875ac8a951119da55e7567471a5fc0ed054fb2b6a"],"state_sha256":"c4a437e1b9ecdb18025e4205a21359df401a46730c692f8410c4e2663242c7e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oh5a9Rh0P2+oPsGThbNqNAIdONx7khtjHyJOSfRvxo+5T5w8ldzPK5T5bRJ2JgTX0m83fFbomEQktHFFqxYVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:50:16.454397Z","bundle_sha256":"3a24dcd77a4456a19eb794b80c4a427dafc1eeb0672b9c5db17a8f9360a040a5"}}