{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4JP2CDQMZ6QUA4326LXT7HATJL","short_pith_number":"pith:4JP2CDQM","schema_version":"1.0","canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","source":{"kind":"arxiv","id":"1603.01213","version":1},"attestation_state":"computed","paper":{"title":"Optimal Rebuilding of Multiple Erasures in MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2016-03-03T18:42:44Z","abstract_excerpt":"MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information in the surviving nodes. However, in practice, $e$ erasures is a more likely failure event, for $1\\le e<r$. Hence, a natural question is how much information do we need to access in order to rebuild $e$ storage nodes? We define the rebuilding ratio as the fraction of remaining information accessed during the rebuilding of $e$ erasures. In our previous work we "},"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":"1603.01213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0904bfa587d64f9e9adda612c4b162f8fe1360d806eb555ff6a9861964b6feca","abstract_canon_sha256":"981398dad0040a87d040e95b9c6572e7e0b34a83eb7ddca0affe5c0e73d569c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.386248Z","signature_b64":"Uj6PnfDDx42uu3VD6Y6z2Qx087GkV1UyHU3ntPPo6vzc0JysFl07ttBnmnxrNpMt523pg2ZAb/7acakBsfhXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","last_reissued_at":"2026-05-18T01:19:39.385602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.385602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Rebuilding of Multiple Erasures in MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2016-03-03T18:42:44Z","abstract_excerpt":"MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information in the surviving nodes. However, in practice, $e$ erasures is a more likely failure event, for $1\\le e<r$. Hence, a natural question is how much information do we need to access in order to rebuild $e$ storage nodes? We define the rebuilding ratio as the fraction of remaining information accessed during the rebuilding of $e$ erasures. In our previous work we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01213","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":"1603.01213","created_at":"2026-05-18T01:19:39.385699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01213v1","created_at":"2026-05-18T01:19:39.385699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01213","created_at":"2026-05-18T01:19:39.385699+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JP2CDQMZ6QU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JP2CDQMZ6QUA432","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JP2CDQM","created_at":"2026-05-18T12:29:58.707656+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/4JP2CDQMZ6QUA4326LXT7HATJL","json":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL.json","graph_json":"https://pith.science/api/pith-number/4JP2CDQMZ6QUA4326LXT7HATJL/graph.json","events_json":"https://pith.science/api/pith-number/4JP2CDQMZ6QUA4326LXT7HATJL/events.json","paper":"https://pith.science/paper/4JP2CDQM"},"agent_actions":{"view_html":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL","download_json":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL.json","view_paper":"https://pith.science/paper/4JP2CDQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01213&json=true","fetch_graph":"https://pith.science/api/pith-number/4JP2CDQMZ6QUA4326LXT7HATJL/graph.json","fetch_events":"https://pith.science/api/pith-number/4JP2CDQMZ6QUA4326LXT7HATJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/action/storage_attestation","attest_author":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/action/author_attestation","sign_citation":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/action/citation_signature","submit_replication":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/action/replication_record"}},"created_at":"2026-05-18T01:19:39.385699+00:00","updated_at":"2026-05-18T01:19:39.385699+00:00"}