{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FPI6MO4MJTJOCMMBRIE3IN2Z3H","short_pith_number":"pith:FPI6MO4M","schema_version":"1.0","canonical_sha256":"2bd1e63b8c4cd2e131818a09b43759d9f1d0e75b71142ccff195bdee8adb4edd","source":{"kind":"arxiv","id":"1407.4167","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4167","created_at":"2026-05-18T02:47:30.961497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4167v1","created_at":"2026-05-18T02:47:30.961497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4167","created_at":"2026-05-18T02:47:30.961497+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPI6MO4MJTJO","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPI6MO4MJTJOCMMB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPI6MO4M","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H","json":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H.json","graph_json":"https://pith.science/api/pith-number/FPI6MO4MJTJOCMMBRIE3IN2Z3H/graph.json","events_json":"https://pith.science/api/pith-number/FPI6MO4MJTJOCMMBRIE3IN2Z3H/events.json","paper":"https://pith.science/paper/FPI6MO4M"},"agent_actions":{"view_html":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H","download_json":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H.json","view_paper":"https://pith.science/paper/FPI6MO4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4167&json=true","fetch_graph":"https://pith.science/api/pith-number/FPI6MO4MJTJOCMMBRIE3IN2Z3H/graph.json","fetch_events":"https://pith.science/api/pith-number/FPI6MO4MJTJOCMMBRIE3IN2Z3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/action/storage_attestation","attest_author":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/action/author_attestation","sign_citation":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/action/citation_signature","submit_replication":"https://pith.science/pith/FPI6MO4MJTJOCMMBRIE3IN2Z3H/action/replication_record"}},"created_at":"2026-05-18T02:47:30.961497+00:00","updated_at":"2026-05-18T02:47:30.961497+00:00"}