{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MPRSGCMWRNALKC22KSLONAGBNO","short_pith_number":"pith:MPRSGCMW","canonical_record":{"source":{"id":"1805.01883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T17:54:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08087ea32777457eb91a794a01bf4509b89710a9a36c0cdaeb15c1426256a00e","abstract_canon_sha256":"21bdbf8bfca50569371fd5f9a1f0fa1b9bfbcd07526ae1d85e91f88aeb0ae319"},"schema_version":"1.0"},"canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","source":{"kind":"arxiv","id":"1805.01883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01883","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01883v1","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01883","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"MPRSGCMWRNAL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPRSGCMWRNALKC22","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPRSGCMW","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MPRSGCMWRNALKC22KSLONAGBNO","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T17:54:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08087ea32777457eb91a794a01bf4509b89710a9a36c0cdaeb15c1426256a00e","abstract_canon_sha256":"21bdbf8bfca50569371fd5f9a1f0fa1b9bfbcd07526ae1d85e91f88aeb0ae319"},"schema_version":"1.0"},"canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:46.375919Z","signature_b64":"tpJIHHUuMm+MW+4niz5dZZg3aoWcCpmSiKOc7P7zN44YXg0lLPsnxwLJJF87dCM1CvrvXGXUcPFubdWnGcKSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","last_reissued_at":"2026-05-18T00:16:46.375403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:46.375403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01883","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-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIhFP7rod0QfYcblqPnr9h7qZKf/Ip1+HOd6757h8xGNQnkqDq+4C9ES2uz9uHc4vssqj2L+RiaS6BswKMOkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:58.645561Z"},"content_sha256":"50a89071860fe277b4ed27879c4df764c3d6b601d2de580d01e9ffaad2965fe8","schema_version":"1.0","event_id":"sha256:50a89071860fe277b4ed27879c4df764c3d6b601d2de580d01e9ffaad2965fe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MPRSGCMWRNALKC22KSLONAGBNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","submitted_at":"2018-05-04T17:54:10Z","abstract_excerpt":"The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed-Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the smallest possible amount of inter-nodal communication. According to the cut-set bound, communication cost of repairing $h\\ge 1$ failed nodes for an $(n,k=n-r)$ MDS code using $d$ helper nodes is at least $dhl/(d+h-k),$ where $l$ is the size of the node. Guruswami and Wootters (2016) initiated the study of efficient repair of RS codes, showing that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01883","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-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9vo3zW07OSwVIFpH0hY+k6aeaq9Fq28lYBZI740DIJ26/v2KXUT3CC+lRrI9U6DDIJs2ARlQAI5SdA1S/fSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:58.646292Z"},"content_sha256":"5ad50e1641d43505931daf6a734c8c0cfd83b1d204ee9bee8c5ea00b38c42b7b","schema_version":"1.0","event_id":"sha256:5ad50e1641d43505931daf6a734c8c0cfd83b1d204ee9bee8c5ea00b38c42b7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/bundle.json","state_url":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPRSGCMWRNALKC22KSLONAGBNO/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-06-07T09:01:58Z","links":{"resolver":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO","bundle":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/bundle.json","state":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPRSGCMWRNALKC22KSLONAGBNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MPRSGCMWRNALKC22KSLONAGBNO","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":"21bdbf8bfca50569371fd5f9a1f0fa1b9bfbcd07526ae1d85e91f88aeb0ae319","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T17:54:10Z","title_canon_sha256":"08087ea32777457eb91a794a01bf4509b89710a9a36c0cdaeb15c1426256a00e"},"schema_version":"1.0","source":{"id":"1805.01883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01883","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01883v1","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01883","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"MPRSGCMWRNAL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPRSGCMWRNALKC22","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPRSGCMW","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:5ad50e1641d43505931daf6a734c8c0cfd83b1d204ee9bee8c5ea00b38c42b7b","target":"graph","created_at":"2026-05-18T00:16:46Z","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 repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed-Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the smallest possible amount of inter-nodal communication. According to the cut-set bound, communication cost of repairing $h\\ge 1$ failed nodes for an $(n,k=n-r)$ MDS code using $d$ helper nodes is at least $dhl/(d+h-k),$ where $l$ is the size of the node. Guruswami and Wootters (2016) initiated the study of efficient repair of RS codes, showing that","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T17:54:10Z","title":"The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01883","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:50a89071860fe277b4ed27879c4df764c3d6b601d2de580d01e9ffaad2965fe8","target":"record","created_at":"2026-05-18T00:16:46Z","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":"21bdbf8bfca50569371fd5f9a1f0fa1b9bfbcd07526ae1d85e91f88aeb0ae319","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-04T17:54:10Z","title_canon_sha256":"08087ea32777457eb91a794a01bf4509b89710a9a36c0cdaeb15c1426256a00e"},"schema_version":"1.0","source":{"id":"1805.01883","kind":"arxiv","version":1}},"canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","first_computed_at":"2026-05-18T00:16:46.375403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:46.375403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tpJIHHUuMm+MW+4niz5dZZg3aoWcCpmSiKOc7P7zN44YXg0lLPsnxwLJJF87dCM1CvrvXGXUcPFubdWnGcKSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:46.375919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50a89071860fe277b4ed27879c4df764c3d6b601d2de580d01e9ffaad2965fe8","sha256:5ad50e1641d43505931daf6a734c8c0cfd83b1d204ee9bee8c5ea00b38c42b7b"],"state_sha256":"82f91a605d96f264789f04b2fbc1c32180baa29519d80fe03fde5cd797a98594"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ryPMiaxGv/QNr3ejJ2e1OZJ8ux0Dl1jhqDW0Q6xAzID90WT4BApfrC9F9Z2QvEtHZ5VoV9gUI/vGoQNHfwJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:01:58.650032Z","bundle_sha256":"777cbd2cd17e75462f51996a6d525c15216b0a749d96f6ba1f37f47093620366"}}