{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YDIPK7IZWODUASKFB6ZTOXWMQ7","short_pith_number":"pith:YDIPK7IZ","schema_version":"1.0","canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","source":{"kind":"arxiv","id":"1803.01098","version":2},"attestation_state":"computed","paper":{"title":"Storage-Efficient Shared Memory Emulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cyril Guyot, Filip Blagojevic, Marwen Zorgui, Robert Mateescu, Zhiying Wang","submitted_at":"2018-03-03T02:54:27Z","abstract_excerpt":"We study the design of storage-efficient algorithms for emulating atomic shared memory over an asynchronous, distributed message-passing system. Our first algorithm is an atomic single-writer multi-reader algorithm based on a novel erasure-coding technique, termed \\emph{multi-version code}. Next, we propose an extension of our single-writer algorithm to a multi-writer multi-reader environment. Our second algorithm combines replication and multi-version code, and is suitable in situations where we expect a large number of concurrent writes. Moreover, when the number of concurrent writes is boun"},"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":"1803.01098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-03T02:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"16e252de4831b32ec9b0f445104e01affb9f8d58ac867a41409f8ce9f39f8435","abstract_canon_sha256":"cdd4efa8ea7b788dd910fd899b28eb472a8cea3b25cff649937a0943e32d7775"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:24.486600Z","signature_b64":"H9sdLOaIB+nAdUgSiSljFZW07nM3W1+SaWXg6TJ3M0Nuulr+TQ3vcDmAkWrpAfN13KDfP2f2MZkE+qj2I1nHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","last_reissued_at":"2026-05-18T00:12:24.486002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:24.486002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Storage-Efficient Shared Memory Emulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cyril Guyot, Filip Blagojevic, Marwen Zorgui, Robert Mateescu, Zhiying Wang","submitted_at":"2018-03-03T02:54:27Z","abstract_excerpt":"We study the design of storage-efficient algorithms for emulating atomic shared memory over an asynchronous, distributed message-passing system. Our first algorithm is an atomic single-writer multi-reader algorithm based on a novel erasure-coding technique, termed \\emph{multi-version code}. Next, we propose an extension of our single-writer algorithm to a multi-writer multi-reader environment. Our second algorithm combines replication and multi-version code, and is suitable in situations where we expect a large number of concurrent writes. Moreover, when the number of concurrent writes is boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01098","kind":"arxiv","version":2},"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":"1803.01098","created_at":"2026-05-18T00:12:24.486093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01098v2","created_at":"2026-05-18T00:12:24.486093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01098","created_at":"2026-05-18T00:12:24.486093+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDIPK7IZWODU","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDIPK7IZWODUASKF","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDIPK7IZ","created_at":"2026-05-18T12:33:04.347982+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/YDIPK7IZWODUASKFB6ZTOXWMQ7","json":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7.json","graph_json":"https://pith.science/api/pith-number/YDIPK7IZWODUASKFB6ZTOXWMQ7/graph.json","events_json":"https://pith.science/api/pith-number/YDIPK7IZWODUASKFB6ZTOXWMQ7/events.json","paper":"https://pith.science/paper/YDIPK7IZ"},"agent_actions":{"view_html":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7","download_json":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7.json","view_paper":"https://pith.science/paper/YDIPK7IZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01098&json=true","fetch_graph":"https://pith.science/api/pith-number/YDIPK7IZWODUASKFB6ZTOXWMQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/YDIPK7IZWODUASKFB6ZTOXWMQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/action/storage_attestation","attest_author":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/action/author_attestation","sign_citation":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/action/citation_signature","submit_replication":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/action/replication_record"}},"created_at":"2026-05-18T00:12:24.486093+00:00","updated_at":"2026-05-18T00:12:24.486093+00:00"}