{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MPRSGCMWRNALKC22KSLONAGBNO","short_pith_number":"pith:MPRSGCMW","schema_version":"1.0","canonical_sha256":"63e32309968b40b50b5a5496e680c16b9ff79f065ce2d5fd44b706b3ac0d6550","source":{"kind":"arxiv","id":"1805.01883","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01883","created_at":"2026-05-18T00:16:46.375474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01883v1","created_at":"2026-05-18T00:16:46.375474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01883","created_at":"2026-05-18T00:16:46.375474+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPRSGCMWRNAL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPRSGCMWRNALKC22","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPRSGCMW","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO","json":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO.json","graph_json":"https://pith.science/api/pith-number/MPRSGCMWRNALKC22KSLONAGBNO/graph.json","events_json":"https://pith.science/api/pith-number/MPRSGCMWRNALKC22KSLONAGBNO/events.json","paper":"https://pith.science/paper/MPRSGCMW"},"agent_actions":{"view_html":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO","download_json":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO.json","view_paper":"https://pith.science/paper/MPRSGCMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01883&json=true","fetch_graph":"https://pith.science/api/pith-number/MPRSGCMWRNALKC22KSLONAGBNO/graph.json","fetch_events":"https://pith.science/api/pith-number/MPRSGCMWRNALKC22KSLONAGBNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/action/storage_attestation","attest_author":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/action/author_attestation","sign_citation":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/action/citation_signature","submit_replication":"https://pith.science/pith/MPRSGCMWRNALKC22KSLONAGBNO/action/replication_record"}},"created_at":"2026-05-18T00:16:46.375474+00:00","updated_at":"2026-05-18T00:16:46.375474+00:00"}