{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X24YBJKK3W7IWP6SVENXVDWKXK","short_pith_number":"pith:X24YBJKK","canonical_record":{"source":{"id":"1708.06042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T01:02:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82374236638f188ad80cf373490377d98ff5c2af3e3f49235fb3985645225642","abstract_canon_sha256":"acc050ab7e2d935261ab11f2dd577b61d3a9bdf088d299f51b573d39da74a8b1"},"schema_version":"1.0"},"canonical_sha256":"beb980a54addbe8b3fd2a91b7a8ecabaa6d9a3a71834b0c9b4ca5f645d4fa79f","source":{"kind":"arxiv","id":"1708.06042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06042","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06042v2","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06042","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"X24YBJKK3W7I","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X24YBJKK3W7IWP6S","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X24YBJKK","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X24YBJKK3W7IWP6SVENXVDWKXK","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T01:02:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82374236638f188ad80cf373490377d98ff5c2af3e3f49235fb3985645225642","abstract_canon_sha256":"acc050ab7e2d935261ab11f2dd577b61d3a9bdf088d299f51b573d39da74a8b1"},"schema_version":"1.0"},"canonical_sha256":"beb980a54addbe8b3fd2a91b7a8ecabaa6d9a3a71834b0c9b4ca5f645d4fa79f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.241039Z","signature_b64":"J3rV05rK89bT1r4/CBsx4yA2MAfI2O7+zKMevjiJuzFT0sVT7Fr9rgZ0rc7WewVynxYJA4QvSW1+NrIj649QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb980a54addbe8b3fd2a91b7a8ecabaa6d9a3a71834b0c9b4ca5f645d4fa79f","last_reissued_at":"2026-05-17T23:51:26.240562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.240562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06042","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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biSc3k7zjOkAJfjWcjC9lYLxsJkwiH8MWBwETY5+XmExyRhmswM4ejaumCgcgN33OGkrWanaSF6hDgwmogueCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:39:02.272111Z"},"content_sha256":"f3faee711ddbf5d2b6227b9e4606615e567e5c6e187833e1f140ebc2514130cb","schema_version":"1.0","event_id":"sha256:f3faee711ddbf5d2b6227b9e4606615e567e5c6e187833e1f140ebc2514130cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X24YBJKK3W7IWP6SVENXVDWKXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ramy E. Ali, Viveck R. Cadambe","submitted_at":"2017-08-21T01:02:01Z","abstract_excerpt":"Motivated by applications of distributed storage systems to key-value stores, the multi-version coding problem was formulated to efficiently store frequently updated data in asynchronous decentralized storage systems. Inspired by consistency requirements in distributed systems, the main goal in the multi-version coding problem is to ensure that the latest possible version of the data is decodable, even if the data updates have not reached some servers in the system. In this paper, we study the storage cost of ensuring consistency for the case where the data versions are correlated, in contrast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06042","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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ToMawV8VrqcIMRMgt/zztjhkivLZFgrRalVArVecztnNlDXKzSH2doCYz5D+ds1krK1zwx4IA78m1C/RaKBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:39:02.272777Z"},"content_sha256":"73ff672c7d8407b251e4a2cafdb70fb84dd7d756828a0373e1e9aa14d32bf66f","schema_version":"1.0","event_id":"sha256:73ff672c7d8407b251e4a2cafdb70fb84dd7d756828a0373e1e9aa14d32bf66f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X24YBJKK3W7IWP6SVENXVDWKXK/bundle.json","state_url":"https://pith.science/pith/X24YBJKK3W7IWP6SVENXVDWKXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X24YBJKK3W7IWP6SVENXVDWKXK/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-26T18:39:02Z","links":{"resolver":"https://pith.science/pith/X24YBJKK3W7IWP6SVENXVDWKXK","bundle":"https://pith.science/pith/X24YBJKK3W7IWP6SVENXVDWKXK/bundle.json","state":"https://pith.science/pith/X24YBJKK3W7IWP6SVENXVDWKXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X24YBJKK3W7IWP6SVENXVDWKXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X24YBJKK3W7IWP6SVENXVDWKXK","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":"acc050ab7e2d935261ab11f2dd577b61d3a9bdf088d299f51b573d39da74a8b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T01:02:01Z","title_canon_sha256":"82374236638f188ad80cf373490377d98ff5c2af3e3f49235fb3985645225642"},"schema_version":"1.0","source":{"id":"1708.06042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06042","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06042v2","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06042","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"X24YBJKK3W7I","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X24YBJKK3W7IWP6S","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X24YBJKK","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:73ff672c7d8407b251e4a2cafdb70fb84dd7d756828a0373e1e9aa14d32bf66f","target":"graph","created_at":"2026-05-17T23:51:26Z","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":"Motivated by applications of distributed storage systems to key-value stores, the multi-version coding problem was formulated to efficiently store frequently updated data in asynchronous decentralized storage systems. Inspired by consistency requirements in distributed systems, the main goal in the multi-version coding problem is to ensure that the latest possible version of the data is decodable, even if the data updates have not reached some servers in the system. In this paper, we study the storage cost of ensuring consistency for the case where the data versions are correlated, in contrast","authors_text":"Ramy E. Ali, Viveck R. Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T01:02:01Z","title":"Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06042","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:f3faee711ddbf5d2b6227b9e4606615e567e5c6e187833e1f140ebc2514130cb","target":"record","created_at":"2026-05-17T23:51:26Z","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":"acc050ab7e2d935261ab11f2dd577b61d3a9bdf088d299f51b573d39da74a8b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T01:02:01Z","title_canon_sha256":"82374236638f188ad80cf373490377d98ff5c2af3e3f49235fb3985645225642"},"schema_version":"1.0","source":{"id":"1708.06042","kind":"arxiv","version":2}},"canonical_sha256":"beb980a54addbe8b3fd2a91b7a8ecabaa6d9a3a71834b0c9b4ca5f645d4fa79f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beb980a54addbe8b3fd2a91b7a8ecabaa6d9a3a71834b0c9b4ca5f645d4fa79f","first_computed_at":"2026-05-17T23:51:26.240562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:26.240562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J3rV05rK89bT1r4/CBsx4yA2MAfI2O7+zKMevjiJuzFT0sVT7Fr9rgZ0rc7WewVynxYJA4QvSW1+NrIj649QCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:26.241039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3faee711ddbf5d2b6227b9e4606615e567e5c6e187833e1f140ebc2514130cb","sha256:73ff672c7d8407b251e4a2cafdb70fb84dd7d756828a0373e1e9aa14d32bf66f"],"state_sha256":"526b742c35361c14ca69be22bb20e3dbdda12e239ec469f5e7f07d182ec01a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNPk1n16Hj/47KixfGjEAGv2qrfHSLDS1zUsq07kXbRNTTXdIZws2tjY8NfWaZ6lgV3O7RmEtnfLVXLS5z+nBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:39:02.276132Z","bundle_sha256":"4f51a76b315e8dc8e9be0040edb6307782f028687d10822333a0a76d1ec1a5b8"}}