{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NTPI2WDU5JUL5U44DC6DRHF5D2","short_pith_number":"pith:NTPI2WDU","canonical_record":{"source":{"id":"2507.17647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-23T16:09:10Z","cross_cats_sorted":[],"title_canon_sha256":"46ae0526c825272a719748124dbc9a83b67e562d06841721d928db4eab97aad5","abstract_canon_sha256":"0a87050388834b2652a67f535f623a4c37ef4e44d1eadc7c2ca48bbe7add5a85"},"schema_version":"1.0"},"canonical_sha256":"6cde8d5874ea68bed39c18bc389cbd1ead0333e7129a3a2d28a705040a277af1","source":{"kind":"arxiv","id":"2507.17647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17647","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17647v1","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17647","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"NTPI2WDU5JUL","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_16","alias_value":"NTPI2WDU5JUL5U44","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_8","alias_value":"NTPI2WDU","created_at":"2026-07-05T11:42:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NTPI2WDU5JUL5U44DC6DRHF5D2","target":"record","payload":{"canonical_record":{"source":{"id":"2507.17647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-23T16:09:10Z","cross_cats_sorted":[],"title_canon_sha256":"46ae0526c825272a719748124dbc9a83b67e562d06841721d928db4eab97aad5","abstract_canon_sha256":"0a87050388834b2652a67f535f623a4c37ef4e44d1eadc7c2ca48bbe7add5a85"},"schema_version":"1.0"},"canonical_sha256":"6cde8d5874ea68bed39c18bc389cbd1ead0333e7129a3a2d28a705040a277af1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:11.187123Z","signature_b64":"3b8LtK4x5EDxAOVISHSMwmMPdrEZynqT5W4C41onLpIPDXx6CBhxIGbZIZVsGfOcDR8fqdZ6Pb6kQtkEXtHnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cde8d5874ea68bed39c18bc389cbd1ead0333e7129a3a2d28a705040a277af1","last_reissued_at":"2026-07-05T11:42:11.186642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:11.186642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.17647","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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaRJGR5OR4cT+T3NBiFdAhoqQ/TOWKnnAv2IFL3T33s5GciAqVDlHIELtG8BffX/jkKqy4dxql5VmSaflFi7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:11:37.506589Z"},"content_sha256":"265d3ef1d45d8b2db548e0d3f9aa6893b2f175c9e1bb0b8467cfbd83c8e8abfd","schema_version":"1.0","event_id":"sha256:265d3ef1d45d8b2db548e0d3f9aa6893b2f175c9e1bb0b8467cfbd83c8e8abfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NTPI2WDU5JUL5U44DC6DRHF5D2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SHINE: A Scalable HNSW Index in Disaggregated Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Kocher, Manuel Widmoser, Nikolaus Augsten","submitted_at":"2025-07-23T16:09:10Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search is a fundamental problem in computer science for which in-memory graph-based methods, such as Hierarchical Navigable Small World (HNSW), perform exceptionally well. To scale beyond billions of high-dimensional vectors, the index must be distributed. The disaggregated memory architecture physically separates compute and memory into two distinct hardware units and has become popular in modern data centers. Both units are connected via RDMA networks that allow compute nodes to directly access remote memory and perform all the computations, posing unique c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17647","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.17647/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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQSJaKDq3acL/jiOGImDp0X4etGeV9zH7UPx/4od13VCzzZwXFHeK2ML2s5zVOonvoXEGtigpJFx+rdZjhpWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:11:37.507403Z"},"content_sha256":"7662b19fede938167a93a7b719e66fa6a7fea3f6f907ffc8f7cd1f0e1f3ee667","schema_version":"1.0","event_id":"sha256:7662b19fede938167a93a7b719e66fa6a7fea3f6f907ffc8f7cd1f0e1f3ee667"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/bundle.json","state_url":"https://pith.science/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/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-08T16:11:37Z","links":{"resolver":"https://pith.science/pith/NTPI2WDU5JUL5U44DC6DRHF5D2","bundle":"https://pith.science/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/bundle.json","state":"https://pith.science/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTPI2WDU5JUL5U44DC6DRHF5D2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NTPI2WDU5JUL5U44DC6DRHF5D2","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":"0a87050388834b2652a67f535f623a4c37ef4e44d1eadc7c2ca48bbe7add5a85","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-23T16:09:10Z","title_canon_sha256":"46ae0526c825272a719748124dbc9a83b67e562d06841721d928db4eab97aad5"},"schema_version":"1.0","source":{"id":"2507.17647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17647","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17647v1","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17647","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"NTPI2WDU5JUL","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_16","alias_value":"NTPI2WDU5JUL5U44","created_at":"2026-07-05T11:42:11Z"},{"alias_kind":"pith_short_8","alias_value":"NTPI2WDU","created_at":"2026-07-05T11:42:11Z"}],"graph_snapshots":[{"event_id":"sha256:7662b19fede938167a93a7b719e66fa6a7fea3f6f907ffc8f7cd1f0e1f3ee667","target":"graph","created_at":"2026-07-05T11:42:11Z","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/2507.17647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate nearest neighbor (ANN) search is a fundamental problem in computer science for which in-memory graph-based methods, such as Hierarchical Navigable Small World (HNSW), perform exceptionally well. To scale beyond billions of high-dimensional vectors, the index must be distributed. The disaggregated memory architecture physically separates compute and memory into two distinct hardware units and has become popular in modern data centers. Both units are connected via RDMA networks that allow compute nodes to directly access remote memory and perform all the computations, posing unique c","authors_text":"Daniel Kocher, Manuel Widmoser, Nikolaus Augsten","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-23T16:09:10Z","title":"SHINE: A Scalable HNSW Index in Disaggregated Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17647","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:265d3ef1d45d8b2db548e0d3f9aa6893b2f175c9e1bb0b8467cfbd83c8e8abfd","target":"record","created_at":"2026-07-05T11:42:11Z","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":"0a87050388834b2652a67f535f623a4c37ef4e44d1eadc7c2ca48bbe7add5a85","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-07-23T16:09:10Z","title_canon_sha256":"46ae0526c825272a719748124dbc9a83b67e562d06841721d928db4eab97aad5"},"schema_version":"1.0","source":{"id":"2507.17647","kind":"arxiv","version":1}},"canonical_sha256":"6cde8d5874ea68bed39c18bc389cbd1ead0333e7129a3a2d28a705040a277af1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cde8d5874ea68bed39c18bc389cbd1ead0333e7129a3a2d28a705040a277af1","first_computed_at":"2026-07-05T11:42:11.186642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:42:11.186642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3b8LtK4x5EDxAOVISHSMwmMPdrEZynqT5W4C41onLpIPDXx6CBhxIGbZIZVsGfOcDR8fqdZ6Pb6kQtkEXtHnCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:42:11.187123Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.17647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:265d3ef1d45d8b2db548e0d3f9aa6893b2f175c9e1bb0b8467cfbd83c8e8abfd","sha256:7662b19fede938167a93a7b719e66fa6a7fea3f6f907ffc8f7cd1f0e1f3ee667"],"state_sha256":"3b79df250210a0ced077a539ac034875a1a97e85cb883ef8aeca1fb2e867ee55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYy+iI1ATT9igZHaSEtgt4ZwBLRUzrpu8R81JuU/lQ9k4oBvrlSiydq7lZ6SsNVgLIUBg1MbHxRjPutt/LnNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:11:37.512542Z","bundle_sha256":"f07f3bb4bf2d9a7a6cc969f828f1b2f38d4e1c0b965ef9ab7e9a368375b4af13"}}