{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TREW3DXPNRD6VVX73EST74YXRU","short_pith_number":"pith:TREW3DXP","canonical_record":{"source":{"id":"1810.09360","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-22T15:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"95560dab25f76025ac5e1eba3bd0279b20a5d914e6c5186c1d0bda010cfec3af","abstract_canon_sha256":"23c64e3ed83c6607c1b6c3e1f01938b40725446877f9571b9db48c2202fbba88"},"schema_version":"1.0"},"canonical_sha256":"9c496d8eef6c47ead6ffd9253ff3178d05bbbc4d2a0fc037e7d4fb60b7363925","source":{"kind":"arxiv","id":"1810.09360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09360","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09360v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09360","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"TREW3DXPNRD6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TREW3DXPNRD6VVX7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TREW3DXP","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TREW3DXPNRD6VVX73EST74YXRU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09360","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-22T15:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"95560dab25f76025ac5e1eba3bd0279b20a5d914e6c5186c1d0bda010cfec3af","abstract_canon_sha256":"23c64e3ed83c6607c1b6c3e1f01938b40725446877f9571b9db48c2202fbba88"},"schema_version":"1.0"},"canonical_sha256":"9c496d8eef6c47ead6ffd9253ff3178d05bbbc4d2a0fc037e7d4fb60b7363925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.360633Z","signature_b64":"MzYqT6ZJfmg8ugkjgN66BjPXF5s8pWsCjxRlmipAZuQM4uGq1lTvuoHXlFMs2co91Yc7+O8qz6aczJhw+wPRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c496d8eef6c47ead6ffd9253ff3178d05bbbc4d2a0fc037e7d4fb60b7363925","last_reissued_at":"2026-05-18T00:02:40.359920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.359920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09360","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-05-18T00:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lo5KENAtfeDPNKXDWWclWsu0PqMfZGr/sMCK6Ss0p6Ekn/CpyqQiLQ46fiaXPOiYNSSyyGol2oRvaWI+Bb6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:22:01.908267Z"},"content_sha256":"71dd591bedfcd104c64a1472897800a723f1f481914ab75a88ce5022e5a660c2","schema_version":"1.0","event_id":"sha256:71dd591bedfcd104c64a1472897800a723f1f481914ab75a88ce5022e5a660c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TREW3DXPNRD6VVX73EST74YXRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enabling Efficient RDMA-based Synchronous Mirroring of Persistent Memory Transactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aasheesh Kolli, Ankit Singla, Arash Tavakkol, Claude Barthels, Hasan Hassan, Juan Gomez-Luna, Kaveh Razavi, Mohammad Sadrosadati, Onur Mutlu, Pratap Subrahmanyam, Saugata Ghose, Stanko Novakovic, Yaohua Wang","submitted_at":"2018-10-22T15:26:08Z","abstract_excerpt":"Synchronous Mirroring (SM) is a standard approach to building highly-available and fault-tolerant enterprise storage systems. SM ensures strong data consistency by maintaining multiple exact data replicas and synchronously propagating every update to all of them. Such strong consistency provides fault tolerance guarantees and a simple programming model coveted by enterprise system designers. For current storage devices, SM comes at modest performance overheads. This is because performing both local and remote updates simultaneously is only marginally slower than performing just local updates, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09360","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":""},"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-05-18T00:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ya9pwPHaXZ/7Rpkra0LC2lxXRC318pVfXmAJTTk+xfKZQZOrwI0JQhXqEXc8riFPgkhkbEZ0J+rHbQQ2UTv0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:22:01.908954Z"},"content_sha256":"99d811e166d4fce0459a78b64676f64082321b269dad6a9266c3292b564317b1","schema_version":"1.0","event_id":"sha256:99d811e166d4fce0459a78b64676f64082321b269dad6a9266c3292b564317b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TREW3DXPNRD6VVX73EST74YXRU/bundle.json","state_url":"https://pith.science/pith/TREW3DXPNRD6VVX73EST74YXRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TREW3DXPNRD6VVX73EST74YXRU/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-05-27T20:22:01Z","links":{"resolver":"https://pith.science/pith/TREW3DXPNRD6VVX73EST74YXRU","bundle":"https://pith.science/pith/TREW3DXPNRD6VVX73EST74YXRU/bundle.json","state":"https://pith.science/pith/TREW3DXPNRD6VVX73EST74YXRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TREW3DXPNRD6VVX73EST74YXRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TREW3DXPNRD6VVX73EST74YXRU","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":"23c64e3ed83c6607c1b6c3e1f01938b40725446877f9571b9db48c2202fbba88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-22T15:26:08Z","title_canon_sha256":"95560dab25f76025ac5e1eba3bd0279b20a5d914e6c5186c1d0bda010cfec3af"},"schema_version":"1.0","source":{"id":"1810.09360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09360","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09360v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09360","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"TREW3DXPNRD6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TREW3DXPNRD6VVX7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TREW3DXP","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:99d811e166d4fce0459a78b64676f64082321b269dad6a9266c3292b564317b1","target":"graph","created_at":"2026-05-18T00:02:40Z","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"},"paper":{"abstract_excerpt":"Synchronous Mirroring (SM) is a standard approach to building highly-available and fault-tolerant enterprise storage systems. SM ensures strong data consistency by maintaining multiple exact data replicas and synchronously propagating every update to all of them. Such strong consistency provides fault tolerance guarantees and a simple programming model coveted by enterprise system designers. For current storage devices, SM comes at modest performance overheads. This is because performing both local and remote updates simultaneously is only marginally slower than performing just local updates, ","authors_text":"Aasheesh Kolli, Ankit Singla, Arash Tavakkol, Claude Barthels, Hasan Hassan, Juan Gomez-Luna, Kaveh Razavi, Mohammad Sadrosadati, Onur Mutlu, Pratap Subrahmanyam, Saugata Ghose, Stanko Novakovic, Yaohua Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-22T15:26:08Z","title":"Enabling Efficient RDMA-based Synchronous Mirroring of Persistent Memory Transactions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09360","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:71dd591bedfcd104c64a1472897800a723f1f481914ab75a88ce5022e5a660c2","target":"record","created_at":"2026-05-18T00:02:40Z","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":"23c64e3ed83c6607c1b6c3e1f01938b40725446877f9571b9db48c2202fbba88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-22T15:26:08Z","title_canon_sha256":"95560dab25f76025ac5e1eba3bd0279b20a5d914e6c5186c1d0bda010cfec3af"},"schema_version":"1.0","source":{"id":"1810.09360","kind":"arxiv","version":1}},"canonical_sha256":"9c496d8eef6c47ead6ffd9253ff3178d05bbbc4d2a0fc037e7d4fb60b7363925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c496d8eef6c47ead6ffd9253ff3178d05bbbc4d2a0fc037e7d4fb60b7363925","first_computed_at":"2026-05-18T00:02:40.359920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:40.359920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MzYqT6ZJfmg8ugkjgN66BjPXF5s8pWsCjxRlmipAZuQM4uGq1lTvuoHXlFMs2co91Yc7+O8qz6aczJhw+wPRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:40.360633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71dd591bedfcd104c64a1472897800a723f1f481914ab75a88ce5022e5a660c2","sha256:99d811e166d4fce0459a78b64676f64082321b269dad6a9266c3292b564317b1"],"state_sha256":"f2d89376db5e2e688294208b92d0db80f2a35e9e7f0935a597452db92a31578e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eg9M4k1a4vnBCw6zseY+9hkMLPR2U5NIVn9DKaK5u9tZt+eaDFToNCn7jKe5s1KyLLtaSRaX/QIDwtouzwmkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:22:01.912194Z","bundle_sha256":"97cec52a082ea032b8e554b46314e1c30d1e1b8cfd060463de1cccffd30e8bc4"}}