{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CWHICYDTPOCH6YV2KIFVTGNXHJ","short_pith_number":"pith:CWHICYDT","schema_version":"1.0","canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","source":{"kind":"arxiv","id":"1604.07671","version":3},"attestation_state":"computed","paper":{"title":"A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Jie Li, Xiaohu Tang","submitted_at":"2016-04-26T13:29:48Z","abstract_excerpt":"We propose a generic transformation that can convert any nonbinary $(n=k+r,k)$ maximum distance separable (MDS) code into another $(n,k)$ MDS code over the same field such that 1) some arbitrarily chosen $r$ nodes have the optimal repair bandwidth and the optimal rebuilding access, 2) for the remaining $k$ nodes, the normalized repair bandwidth and the normalized rebuilding access (over the file size) are preserved, 3) the sub-packetization level is increased only by a factor of $r$. Two immediate applications of this generic transformation are then presented. The first application is that 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":"1604.07671","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T13:29:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d85bdcd1162a6aef0da0b261c9e6864706108d6e6c5ca1aa64dedade74934643","abstract_canon_sha256":"1dcfce3c64369165b9be2cbe6338ed7892c79f3440ee349f2b09e9efc40aba52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:28.605966Z","signature_b64":"UKEgE8J6A+VLZfEgcFWekK44s+DscMmEzj8ogDyQginuLmDx3C5h40NdlYPo11qee++nR13a+A5QcXnM7R1DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","last_reissued_at":"2026-05-18T00:07:28.605437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:28.605437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Jie Li, Xiaohu Tang","submitted_at":"2016-04-26T13:29:48Z","abstract_excerpt":"We propose a generic transformation that can convert any nonbinary $(n=k+r,k)$ maximum distance separable (MDS) code into another $(n,k)$ MDS code over the same field such that 1) some arbitrarily chosen $r$ nodes have the optimal repair bandwidth and the optimal rebuilding access, 2) for the remaining $k$ nodes, the normalized repair bandwidth and the normalized rebuilding access (over the file size) are preserved, 3) the sub-packetization level is increased only by a factor of $r$. Two immediate applications of this generic transformation are then presented. The first application is that we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07671","kind":"arxiv","version":3},"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":"1604.07671","created_at":"2026-05-18T00:07:28.605532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07671v3","created_at":"2026-05-18T00:07:28.605532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07671","created_at":"2026-05-18T00:07:28.605532+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWHICYDTPOCH","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWHICYDTPOCH6YV2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWHICYDT","created_at":"2026-05-18T12:30:09.641336+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/CWHICYDTPOCH6YV2KIFVTGNXHJ","json":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ.json","graph_json":"https://pith.science/api/pith-number/CWHICYDTPOCH6YV2KIFVTGNXHJ/graph.json","events_json":"https://pith.science/api/pith-number/CWHICYDTPOCH6YV2KIFVTGNXHJ/events.json","paper":"https://pith.science/paper/CWHICYDT"},"agent_actions":{"view_html":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ","download_json":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ.json","view_paper":"https://pith.science/paper/CWHICYDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07671&json=true","fetch_graph":"https://pith.science/api/pith-number/CWHICYDTPOCH6YV2KIFVTGNXHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CWHICYDTPOCH6YV2KIFVTGNXHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/action/storage_attestation","attest_author":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/action/author_attestation","sign_citation":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/action/citation_signature","submit_replication":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/action/replication_record"}},"created_at":"2026-05-18T00:07:28.605532+00:00","updated_at":"2026-05-18T00:07:28.605532+00:00"}