{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FPI6MO4MJTJOCMMBRIE3IN2Z3H","short_pith_number":"pith:FPI6MO4M","canonical_record":{"source":{"id":"1407.4167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-15T22:59:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2cb2c4707a175e76feb1e64a24a4d6aec95ea201c197d34e790901db3a71065c","abstract_canon_sha256":"06f3807f3caa40c8e31a14241abc99a62781461bc9bf88a8b8397cf523603194"},"schema_version":"1.0"},"canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","source":{"kind":"arxiv","id":"1407.4167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4167","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4167v1","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4167","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"pith_short_12","alias_value":"FPI6MO4MJTJO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPI6MO4MJTJOCMMB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPI6MO4M","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FPI6MO4MJTJOCMMBRIE3IN2Z3H","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-15T22:59:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2cb2c4707a175e76feb1e64a24a4d6aec95ea201c197d34e790901db3a71065c","abstract_canon_sha256":"06f3807f3caa40c8e31a14241abc99a62781461bc9bf88a8b8397cf523603194"},"schema_version":"1.0"},"canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:30.961959Z","signature_b64":"fBAsbfB1jAT9MsAJerMr3q3l8keAnsofWAcgsU82XRd3b/aHV7lp1ObOfMEOPjFN1nO8kNvooFQXSDMlH+RgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","last_reissued_at":"2026-05-18T02:47:30.961399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:30.961399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4167","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-18T02:47:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lS5xPh4fZ2JiA04+6LSsKVhwj2D5ki+dcSpNdjvACLEfH3K2nEcZI/Xvzm3jZmCh9+YvYi2GdFu+rxiVGfhSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:08:41.114135Z"},"content_sha256":"998f0134b92018b27e1dae20109f25e3c39ecb1f819952eff608146135e4d4c3","schema_version":"1.0","event_id":"sha256:998f0134b92018b27e1dae20109f25e3c39ecb1f819952eff608146135e4d4c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FPI6MO4MJTJOCMMBRIE3IN2Z3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coded Shared Atomic Memory Algorithm for Message Passing Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Muriel M\\'edard, Nancy Lynch, Peter Musial, Viveck R. Cadambe","submitted_at":"2014-07-15T22:59:29Z","abstract_excerpt":"This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) We present a atomic shared-memory emulation algorithm that we call Coded Atomic Storage (CAS). This algorithm uses erasure coding methods. In a storage system with $N$ servers that is resilient to $f$ server failures, we show that the communication cost of CAS is $\\frac{N}{N-2f}$. The storage cost of CAS is unbounded. (2) We present a modification of the CAS algorithm known as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4167","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-18T02:47:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia7SVMWKLxh5sXzhWhvrwFWvNdCFq3m4cZFJlPOmux8UAe8Ilmd3H2GrBY/QAug0nfXZf+T0tHnU46tfhHFTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:08:41.114871Z"},"content_sha256":"f0af680836593fffff39861c97ef5d6e4781f80bfcf14b44ccb86ee5de497685","schema_version":"1.0","event_id":"sha256:f0af680836593fffff39861c97ef5d6e4781f80bfcf14b44ccb86ee5de497685"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/bundle.json","state_url":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/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-28T20:08:41Z","links":{"resolver":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H","bundle":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/bundle.json","state":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FPI6MO4MJTJOCMMBRIE3IN2Z3H","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":"06f3807f3caa40c8e31a14241abc99a62781461bc9bf88a8b8397cf523603194","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-15T22:59:29Z","title_canon_sha256":"2cb2c4707a175e76feb1e64a24a4d6aec95ea201c197d34e790901db3a71065c"},"schema_version":"1.0","source":{"id":"1407.4167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4167","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4167v1","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4167","created_at":"2026-05-18T02:47:30Z"},{"alias_kind":"pith_short_12","alias_value":"FPI6MO4MJTJO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPI6MO4MJTJOCMMB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPI6MO4M","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f0af680836593fffff39861c97ef5d6e4781f80bfcf14b44ccb86ee5de497685","target":"graph","created_at":"2026-05-18T02:47:30Z","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":"This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) We present a atomic shared-memory emulation algorithm that we call Coded Atomic Storage (CAS). This algorithm uses erasure coding methods. In a storage system with $N$ servers that is resilient to $f$ server failures, we show that the communication cost of CAS is $\\frac{N}{N-2f}$. The storage cost of CAS is unbounded. (2) We present a modification of the CAS algorithm known as","authors_text":"Muriel M\\'edard, Nancy Lynch, Peter Musial, Viveck R. Cadambe","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-15T22:59:29Z","title":"A Coded Shared Atomic Memory Algorithm for Message Passing Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4167","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:998f0134b92018b27e1dae20109f25e3c39ecb1f819952eff608146135e4d4c3","target":"record","created_at":"2026-05-18T02:47:30Z","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":"06f3807f3caa40c8e31a14241abc99a62781461bc9bf88a8b8397cf523603194","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-15T22:59:29Z","title_canon_sha256":"2cb2c4707a175e76feb1e64a24a4d6aec95ea201c197d34e790901db3a71065c"},"schema_version":"1.0","source":{"id":"1407.4167","kind":"arxiv","version":1}},"canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","first_computed_at":"2026-05-18T02:47:30.961399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:30.961399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBAsbfB1jAT9MsAJerMr3q3l8keAnsofWAcgsU82XRd3b/aHV7lp1ObOfMEOPjFN1nO8kNvooFQXSDMlH+RgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:30.961959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:998f0134b92018b27e1dae20109f25e3c39ecb1f819952eff608146135e4d4c3","sha256:f0af680836593fffff39861c97ef5d6e4781f80bfcf14b44ccb86ee5de497685"],"state_sha256":"46e47c5cfa6f6c864a330537889b99e0836e6feb534b67a497e8056189063d19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rww0G4tk0SYDT7FPB/PZ6UTkWdPhkI3k1X/QvQqhHh8g1zm5Eo28CSQFEeMUsradilC4/dMvi5SthfqhV56wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:08:41.118923Z","bundle_sha256":"786e3fd1edd34b9af04c4e3a1c4cb3e929adaf5f03eaa75d592a2488e65185d1"}}