{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3UNHZKI7B2UUZX2EX5ZXGNTKA2","short_pith_number":"pith:3UNHZKI7","canonical_record":{"source":{"id":"1605.06844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-22T19:55:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c0e9d14f9dd15fd01c8c251caf6f5d16ac99f57b37a309b2026c120a99daada3","abstract_canon_sha256":"38be7c0251712743fe296d7790fb57a3cfa696c3ef92155f09c2499181aa8635"},"schema_version":"1.0"},"canonical_sha256":"dd1a7ca91f0ea94cdf44bf7373366a069cac5c4f5509c1003ce58eb1716757e6","source":{"kind":"arxiv","id":"1605.06844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06844","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06844v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06844","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"3UNHZKI7B2UU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UNHZKI7B2UUZX2E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UNHZKI7","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3UNHZKI7B2UUZX2EX5ZXGNTKA2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-22T19:55:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c0e9d14f9dd15fd01c8c251caf6f5d16ac99f57b37a309b2026c120a99daada3","abstract_canon_sha256":"38be7c0251712743fe296d7790fb57a3cfa696c3ef92155f09c2499181aa8635"},"schema_version":"1.0"},"canonical_sha256":"dd1a7ca91f0ea94cdf44bf7373366a069cac5c4f5509c1003ce58eb1716757e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.421874Z","signature_b64":"LDJBe2zi7V12Ip6BwmUet/57xtCT8ct9KGHptOwFw1xsF4MpA5EQQfPwHBvtZf13XTq3AhMltFj/mH0lixH1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1a7ca91f0ea94cdf44bf7373366a069cac5c4f5509c1003ce58eb1716757e6","last_reissued_at":"2026-05-18T01:13:39.421290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.421290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06844","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GRcOTFOaOc27+8T/+MryE90URe2dEu3z+Q7nXCnFI08lPTe9d0gjCjTPKqzLAeNeNYZ+SOHKXWaknDMgDrsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:35:35.163618Z"},"content_sha256":"b1398309ba7b402b6dffe56d80bab863892b78a34c3a7e2f3460bd1d2f8b3e5d","schema_version":"1.0","event_id":"sha256:b1398309ba7b402b6dffe56d80bab863892b78a34c3a7e2f3460bd1d2f8b3e5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3UNHZKI7B2UUZX2EX5ZXGNTKA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Nancy Lynch, Viveck R. Cadambe, Zhiying Wang","submitted_at":"2016-05-22T19:55:05Z","abstract_excerpt":"The focus of this paper is to understand storage costs of emulating an atomic shared memory over an asynchronous, distributed message passing system. Previous literature has developed several shared memory emulation algorithms based on replication and erasure coding techniques. In this paper, we present information-theoretic lower bounds on the storage costs incurred by shared memory emulation algorithms. Our storage cost lower bounds are universally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data.\n  We consider an arbitrary algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06844","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53XabP9J9/7H4HW85cu0uwaxjln2jwuvhoN+Axj4qUsqAlRv9ke8SPOW34rjhu4Cr4H/8zzp1TxcfVfzkqsICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:35:35.164150Z"},"content_sha256":"b7252f0665ce60e8d041e6f1124ca8f71c4a405e4e5b181d0d474b88d13cc22a","schema_version":"1.0","event_id":"sha256:b7252f0665ce60e8d041e6f1124ca8f71c4a405e4e5b181d0d474b88d13cc22a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/bundle.json","state_url":"https://pith.science/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/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-28T17:35:35Z","links":{"resolver":"https://pith.science/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2","bundle":"https://pith.science/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/bundle.json","state":"https://pith.science/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UNHZKI7B2UUZX2EX5ZXGNTKA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3UNHZKI7B2UUZX2EX5ZXGNTKA2","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":"38be7c0251712743fe296d7790fb57a3cfa696c3ef92155f09c2499181aa8635","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-22T19:55:05Z","title_canon_sha256":"c0e9d14f9dd15fd01c8c251caf6f5d16ac99f57b37a309b2026c120a99daada3"},"schema_version":"1.0","source":{"id":"1605.06844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06844","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06844v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06844","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"3UNHZKI7B2UU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UNHZKI7B2UUZX2E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UNHZKI7","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:b7252f0665ce60e8d041e6f1124ca8f71c4a405e4e5b181d0d474b88d13cc22a","target":"graph","created_at":"2026-05-18T01:13:39Z","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":"The focus of this paper is to understand storage costs of emulating an atomic shared memory over an asynchronous, distributed message passing system. Previous literature has developed several shared memory emulation algorithms based on replication and erasure coding techniques. In this paper, we present information-theoretic lower bounds on the storage costs incurred by shared memory emulation algorithms. Our storage cost lower bounds are universally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data.\n  We consider an arbitrary algor","authors_text":"Nancy Lynch, Viveck R. Cadambe, Zhiying Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-22T19:55:05Z","title":"Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06844","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:b1398309ba7b402b6dffe56d80bab863892b78a34c3a7e2f3460bd1d2f8b3e5d","target":"record","created_at":"2026-05-18T01:13:39Z","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":"38be7c0251712743fe296d7790fb57a3cfa696c3ef92155f09c2499181aa8635","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-22T19:55:05Z","title_canon_sha256":"c0e9d14f9dd15fd01c8c251caf6f5d16ac99f57b37a309b2026c120a99daada3"},"schema_version":"1.0","source":{"id":"1605.06844","kind":"arxiv","version":2}},"canonical_sha256":"dd1a7ca91f0ea94cdf44bf7373366a069cac5c4f5509c1003ce58eb1716757e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd1a7ca91f0ea94cdf44bf7373366a069cac5c4f5509c1003ce58eb1716757e6","first_computed_at":"2026-05-18T01:13:39.421290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.421290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LDJBe2zi7V12Ip6BwmUet/57xtCT8ct9KGHptOwFw1xsF4MpA5EQQfPwHBvtZf13XTq3AhMltFj/mH0lixH1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.421874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1398309ba7b402b6dffe56d80bab863892b78a34c3a7e2f3460bd1d2f8b3e5d","sha256:b7252f0665ce60e8d041e6f1124ca8f71c4a405e4e5b181d0d474b88d13cc22a"],"state_sha256":"da44eeeab36daa0c09de8f05cf9da38527c3d92dd006caa37dce0cbd0887e918"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gx7HDldRxjmvvTSAh4eGOJERzb3k/1JbC4afvaJOlkTSUBXzR0wwMbPIN0ljB4/Ggg7iTslWcWgQqopf129gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:35:35.167346Z","bundle_sha256":"6c9a6b907b6aa8e0faa3f182ce36c19651cba7d5758685c871efaff9169df705"}}