{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDIPK7IZWODUASKFB6ZTOXWMQ7","short_pith_number":"pith:YDIPK7IZ","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"},"canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","source":{"kind":"arxiv","id":"1803.01098","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01098","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01098v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01098","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"YDIPK7IZWODU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDIPK7IZWODUASKF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDIPK7IZ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDIPK7IZWODUASKFB6ZTOXWMQ7","target":"record","payload":{"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"},"canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","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"},"source_kind":"arxiv","source_id":"1803.01098","source_version":2,"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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIvbugRTZMmkBxhvIogXA0/LYZ5XsaPQcpm43SkOrwv0QaZYXR7mbXgNlY8V/vgrSCy/kguhV5SmoGZIslSVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:41.226489Z"},"content_sha256":"38816deb236711aba1234e8fb0fa84dc286fd756a33bdac47ef3911a8cc71600","schema_version":"1.0","event_id":"sha256:38816deb236711aba1234e8fb0fa84dc286fd756a33bdac47ef3911a8cc71600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDIPK7IZWODUASKFB6ZTOXWMQ7","target":"graph","payload":{"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"},"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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDef9Jp3Hw5PE9pdkVUYKo0KxLAxlurscICPvZI+6lRwWD69A/XLtlWcfc0N2xpHEDETSHXP9t/VYE12gx1WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:00:41.226836Z"},"content_sha256":"2b2306c983c068d7cabe7e539940eced6714e5ade859dd86874b4578cd7e7523","schema_version":"1.0","event_id":"sha256:2b2306c983c068d7cabe7e539940eced6714e5ade859dd86874b4578cd7e7523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/bundle.json","state_url":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/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-30T05:00:41Z","links":{"resolver":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7","bundle":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/bundle.json","state":"https://pith.science/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDIPK7IZWODUASKFB6ZTOXWMQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDIPK7IZWODUASKFB6ZTOXWMQ7","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":"cdd4efa8ea7b788dd910fd899b28eb472a8cea3b25cff649937a0943e32d7775","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-03T02:54:27Z","title_canon_sha256":"16e252de4831b32ec9b0f445104e01affb9f8d58ac867a41409f8ce9f39f8435"},"schema_version":"1.0","source":{"id":"1803.01098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01098","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01098v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01098","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"YDIPK7IZWODU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDIPK7IZWODUASKF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDIPK7IZ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:2b2306c983c068d7cabe7e539940eced6714e5ade859dd86874b4578cd7e7523","target":"graph","created_at":"2026-05-18T00:12:24Z","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":"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","authors_text":"Cyril Guyot, Filip Blagojevic, Marwen Zorgui, Robert Mateescu, Zhiying Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-03T02:54:27Z","title":"Storage-Efficient Shared Memory Emulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01098","kind":"arxiv","version":2},"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:38816deb236711aba1234e8fb0fa84dc286fd756a33bdac47ef3911a8cc71600","target":"record","created_at":"2026-05-18T00:12:24Z","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":"cdd4efa8ea7b788dd910fd899b28eb472a8cea3b25cff649937a0943e32d7775","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-03T02:54:27Z","title_canon_sha256":"16e252de4831b32ec9b0f445104e01affb9f8d58ac867a41409f8ce9f39f8435"},"schema_version":"1.0","source":{"id":"1803.01098","kind":"arxiv","version":2}},"canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d0f57d19b3874049450fb3375ecc87cae31bff4c28b1476333043eb05fc6cd","first_computed_at":"2026-05-18T00:12:24.486002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:24.486002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H9sdLOaIB+nAdUgSiSljFZW07nM3W1+SaWXg6TJ3M0Nuulr+TQ3vcDmAkWrpAfN13KDfP2f2MZkE+qj2I1nHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:24.486600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38816deb236711aba1234e8fb0fa84dc286fd756a33bdac47ef3911a8cc71600","sha256:2b2306c983c068d7cabe7e539940eced6714e5ade859dd86874b4578cd7e7523"],"state_sha256":"11e5b958f294d0523d587da1c9da6739e95866a55500f481a0e845db6af20ed6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbYEss+hAGr8m33JsrCK6gEf91sRHwdDR+DPQ3JT9qd711fym83zp88b5pb8yHJpryRaI962xoDifLiBfG7sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:00:41.228803Z","bundle_sha256":"0353350dad13e8e13957a73601523c768662b872ea49fc17a3654ca032029ffe"}}