{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SBDHSUVTPVLNM5XKSF4GS2P3LR","short_pith_number":"pith:SBDHSUVT","canonical_record":{"source":{"id":"2502.08982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-13T05:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"c8650d546d09f624ee4a59cc8fdd6646dbb141d9572f28444a006304d8d74e10","abstract_canon_sha256":"9771048e5c1f40be31fb2d23179c97c98c973ec76cb810629dc9bb1e070421d5"},"schema_version":"1.0"},"canonical_sha256":"90467952b37d56d676ea91786969fb5c6daad91ca189a17393ed93e81721a02b","source":{"kind":"arxiv","id":"2502.08982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08982","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08982v1","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08982","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_12","alias_value":"SBDHSUVTPVLN","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBDHSUVTPVLNM5XK","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBDHSUVT","created_at":"2026-07-05T10:13:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SBDHSUVTPVLNM5XKSF4GS2P3LR","target":"record","payload":{"canonical_record":{"source":{"id":"2502.08982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-13T05:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"c8650d546d09f624ee4a59cc8fdd6646dbb141d9572f28444a006304d8d74e10","abstract_canon_sha256":"9771048e5c1f40be31fb2d23179c97c98c973ec76cb810629dc9bb1e070421d5"},"schema_version":"1.0"},"canonical_sha256":"90467952b37d56d676ea91786969fb5c6daad91ca189a17393ed93e81721a02b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:50.759800Z","signature_b64":"rMLIHnU8OPeZ8H4MHSyFGZlMVFaN20nIfpB/lB0qmQVM3nbnzSwAkDiWhcJ1N+WsySukMnS72PyfKuwPpB9BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90467952b37d56d676ea91786969fb5c6daad91ca189a17393ed93e81721a02b","last_reissued_at":"2026-07-05T10:13:50.759320Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:50.759320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.08982","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-05T10:13:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47j/eMmsqXZ2BIqn+pBTHZFOWpqxTaeMx3hjx1m1ZkKpwtMN5IpdlfnyFn6DzOR2Ev4ADXaO5npqy+peT7wlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:38.031689Z"},"content_sha256":"73f29e103336dd59fec862215c9b1cbf784299aa890d52a281ef38d4d58df905","schema_version":"1.0","event_id":"sha256:73f29e103336dd59fec862215c9b1cbf784299aa890d52a281ef38d4d58df905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SBDHSUVTPVLNM5XKSF4GS2P3LR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Outback: Fast and Communication-efficient Index for Key-Value Store on Disaggregated Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Qian, Heiner Litz, Minghao Xie, Shouqian Shi, Yi Liu, Yuanchao Xu","submitted_at":"2025-02-13T05:40:28Z","abstract_excerpt":"Disaggregated memory systems achieve resource utilization efficiency and system scalability by distributing computation and memory resources into distinct pools of nodes. RDMA is an attractive solution to support high-throughput communication between different disaggregated resource pools. However, existing RDMA solutions face a dilemma: one-sided RDMA completely bypasses computation at memory nodes, but its communication takes multiple round trips; two-sided RDMA achieves one-round-trip communication but requires non-trivial computation for index lookups at memory nodes, which violates the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08982","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/2502.08982/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-05T10:13:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpN95UGlF4JadXpT8GZ8lGsUvGi1uT3DlrrQBaPmxm5146MiBdNhiwYq1IcwnHu94c4JxHkgagXttBTv60EWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:38.032058Z"},"content_sha256":"33af0c822ce006825b80bfd759a35a93b8835a7dc260254467fe54e8e9953ccd","schema_version":"1.0","event_id":"sha256:33af0c822ce006825b80bfd759a35a93b8835a7dc260254467fe54e8e9953ccd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/bundle.json","state_url":"https://pith.science/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/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-07-06T18:34:38Z","links":{"resolver":"https://pith.science/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR","bundle":"https://pith.science/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/bundle.json","state":"https://pith.science/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBDHSUVTPVLNM5XKSF4GS2P3LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SBDHSUVTPVLNM5XKSF4GS2P3LR","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":"9771048e5c1f40be31fb2d23179c97c98c973ec76cb810629dc9bb1e070421d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-13T05:40:28Z","title_canon_sha256":"c8650d546d09f624ee4a59cc8fdd6646dbb141d9572f28444a006304d8d74e10"},"schema_version":"1.0","source":{"id":"2502.08982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08982","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08982v1","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08982","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_12","alias_value":"SBDHSUVTPVLN","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBDHSUVTPVLNM5XK","created_at":"2026-07-05T10:13:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBDHSUVT","created_at":"2026-07-05T10:13:50Z"}],"graph_snapshots":[{"event_id":"sha256:33af0c822ce006825b80bfd759a35a93b8835a7dc260254467fe54e8e9953ccd","target":"graph","created_at":"2026-07-05T10:13:50Z","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/2502.08982/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Disaggregated memory systems achieve resource utilization efficiency and system scalability by distributing computation and memory resources into distinct pools of nodes. RDMA is an attractive solution to support high-throughput communication between different disaggregated resource pools. However, existing RDMA solutions face a dilemma: one-sided RDMA completely bypasses computation at memory nodes, but its communication takes multiple round trips; two-sided RDMA achieves one-round-trip communication but requires non-trivial computation for index lookups at memory nodes, which violates the pr","authors_text":"Chen Qian, Heiner Litz, Minghao Xie, Shouqian Shi, Yi Liu, Yuanchao Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-13T05:40:28Z","title":"Outback: Fast and Communication-efficient Index for Key-Value Store on Disaggregated Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08982","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:73f29e103336dd59fec862215c9b1cbf784299aa890d52a281ef38d4d58df905","target":"record","created_at":"2026-07-05T10:13:50Z","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":"9771048e5c1f40be31fb2d23179c97c98c973ec76cb810629dc9bb1e070421d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-13T05:40:28Z","title_canon_sha256":"c8650d546d09f624ee4a59cc8fdd6646dbb141d9572f28444a006304d8d74e10"},"schema_version":"1.0","source":{"id":"2502.08982","kind":"arxiv","version":1}},"canonical_sha256":"90467952b37d56d676ea91786969fb5c6daad91ca189a17393ed93e81721a02b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90467952b37d56d676ea91786969fb5c6daad91ca189a17393ed93e81721a02b","first_computed_at":"2026-07-05T10:13:50.759320Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:50.759320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMLIHnU8OPeZ8H4MHSyFGZlMVFaN20nIfpB/lB0qmQVM3nbnzSwAkDiWhcJ1N+WsySukMnS72PyfKuwPpB9BAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:50.759800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73f29e103336dd59fec862215c9b1cbf784299aa890d52a281ef38d4d58df905","sha256:33af0c822ce006825b80bfd759a35a93b8835a7dc260254467fe54e8e9953ccd"],"state_sha256":"b654fd81fa3d5cf852a4ba55644d34fb0d73acb0e8745f1bf7097365594819d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSVaB1Xf7RM7OakGhc3+oDvV5f7Xyldv1C6vIAr1g6PsgCH7SeCY9Y++AF5f3cSsIAbI5r+Cz/I+idX3UNrRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:34:38.034096Z","bundle_sha256":"854a121ed92ce65746d2b596b49e0a76fb74de8cff18605e453f7bc6e2248c66"}}