{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4VYZSGGTI5H5V3KSHSO2UIRK5J","short_pith_number":"pith:4VYZSGGT","canonical_record":{"source":{"id":"1507.05169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-18T10:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"08dbdcb15231a36d204f2c4ed988b246ab94b787558481fe572f2d4deec8364d","abstract_canon_sha256":"a6e4160b9715d9204daa5f52e0fadf91face04a19448299fd194913c44565c9d"},"schema_version":"1.0"},"canonical_sha256":"e5719918d3474fdaed523c9daa222aea6e4b7d4bf9a1fdc6c04b02d9b0258663","source":{"kind":"arxiv","id":"1507.05169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05169","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05169v1","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05169","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"4VYZSGGTI5H5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4VYZSGGTI5H5V3KS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4VYZSGGT","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4VYZSGGTI5H5V3KSHSO2UIRK5J","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-18T10:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"08dbdcb15231a36d204f2c4ed988b246ab94b787558481fe572f2d4deec8364d","abstract_canon_sha256":"a6e4160b9715d9204daa5f52e0fadf91face04a19448299fd194913c44565c9d"},"schema_version":"1.0"},"canonical_sha256":"e5719918d3474fdaed523c9daa222aea6e4b7d4bf9a1fdc6c04b02d9b0258663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:41.238837Z","signature_b64":"rgpl7qPSNmpKGH4uNGIA8eO4DxAcJxxSL/6TuY6ijlke8Bll+PmQA5zkHyG720D2Gi7GPMyPRce0uzhTmJl+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5719918d3474fdaed523c9daa222aea6e4b7d4bf9a1fdc6c04b02d9b0258663","last_reissued_at":"2026-05-18T01:36:41.238283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:41.238283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05169","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-18T01:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rpUu+/a36ZJlHq5B+rQACJvylLL6nDNq0gkzC4+4GbWZKJD83BnLzlwYH8Nc/dV45CZVDkc/2S1QP2EnC0EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:58:40.003135Z"},"content_sha256":"b67b0f1b1228b1547012fc95888e522c8d2248480655f004f4dd69784777ac40","schema_version":"1.0","event_id":"sha256:b67b0f1b1228b1547012fc95888e522c8d2248480655f004f4dd69784777ac40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4VYZSGGTI5H5V3KSHSO2UIRK5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Bounds for Reliable Storage: Fundamental Limits of Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Gregory Chockler, Idit Keidar, Yuval Cassuto","submitted_at":"2015-07-18T10:25:18Z","abstract_excerpt":"We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-known replication approach. However, a closer look reveals that they incur extra costs somewhere else: Some use unbounded storage in communication links, while others assume bounded concurrency or synchronous periods. We prove here that this is inherent, and indeed, if there is no bound on the concurrency level, then the storage cost of any reliable storage algorithm is at least f+1 times the data size, where f is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05169","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-18T01:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcKHnZQrZGm3psmzIks/qZ1evSGBmpZ/YTzRfLukfenAkeXBDOdqx1SZHxeLJtT7hmlUVNzTiI+NJgais2BJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:58:40.003614Z"},"content_sha256":"c017f0b742637a730e03bf5e24cca6a8997e12b1261ad9167ff0029467935766","schema_version":"1.0","event_id":"sha256:c017f0b742637a730e03bf5e24cca6a8997e12b1261ad9167ff0029467935766"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/bundle.json","state_url":"https://pith.science/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/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-22T06:58:40Z","links":{"resolver":"https://pith.science/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J","bundle":"https://pith.science/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/bundle.json","state":"https://pith.science/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VYZSGGTI5H5V3KSHSO2UIRK5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4VYZSGGTI5H5V3KSHSO2UIRK5J","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":"a6e4160b9715d9204daa5f52e0fadf91face04a19448299fd194913c44565c9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-18T10:25:18Z","title_canon_sha256":"08dbdcb15231a36d204f2c4ed988b246ab94b787558481fe572f2d4deec8364d"},"schema_version":"1.0","source":{"id":"1507.05169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05169","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05169v1","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05169","created_at":"2026-05-18T01:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"4VYZSGGTI5H5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4VYZSGGTI5H5V3KS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4VYZSGGT","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c017f0b742637a730e03bf5e24cca6a8997e12b1261ad9167ff0029467935766","target":"graph","created_at":"2026-05-18T01:36:41Z","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 inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-known replication approach. However, a closer look reveals that they incur extra costs somewhere else: Some use unbounded storage in communication links, while others assume bounded concurrency or synchronous periods. We prove here that this is inherent, and indeed, if there is no bound on the concurrency level, then the storage cost of any reliable storage algorithm is at least f+1 times the data size, where f is the","authors_text":"Alexander Spiegelman, Gregory Chockler, Idit Keidar, Yuval Cassuto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-18T10:25:18Z","title":"Space Bounds for Reliable Storage: Fundamental Limits of Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05169","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:b67b0f1b1228b1547012fc95888e522c8d2248480655f004f4dd69784777ac40","target":"record","created_at":"2026-05-18T01:36:41Z","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":"a6e4160b9715d9204daa5f52e0fadf91face04a19448299fd194913c44565c9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-18T10:25:18Z","title_canon_sha256":"08dbdcb15231a36d204f2c4ed988b246ab94b787558481fe572f2d4deec8364d"},"schema_version":"1.0","source":{"id":"1507.05169","kind":"arxiv","version":1}},"canonical_sha256":"e5719918d3474fdaed523c9daa222aea6e4b7d4bf9a1fdc6c04b02d9b0258663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5719918d3474fdaed523c9daa222aea6e4b7d4bf9a1fdc6c04b02d9b0258663","first_computed_at":"2026-05-18T01:36:41.238283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:41.238283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgpl7qPSNmpKGH4uNGIA8eO4DxAcJxxSL/6TuY6ijlke8Bll+PmQA5zkHyG720D2Gi7GPMyPRce0uzhTmJl+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:41.238837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b67b0f1b1228b1547012fc95888e522c8d2248480655f004f4dd69784777ac40","sha256:c017f0b742637a730e03bf5e24cca6a8997e12b1261ad9167ff0029467935766"],"state_sha256":"c210adeac8a849fc55f5b3442190c172f03b5d6e69ec4a9d279bba79160ef66b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVCwtbZw9UVKqQ7sk4pSWmeTFWcCWjrKPVfiJgiDkPNMfwIKBq9e6+sNKh81dG6S1lXyEm8mlx7Ji3L1aEslBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T06:58:40.006518Z","bundle_sha256":"2c41db8f20f9d98b96bcf43d82e058dc24a2832948502969f99adafa792d48d0"}}