{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CWHICYDTPOCH6YV2KIFVTGNXHJ","short_pith_number":"pith:CWHICYDT","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"},"canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","source":{"kind":"arxiv","id":"1604.07671","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07671","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07671v3","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07671","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"CWHICYDTPOCH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWHICYDTPOCH6YV2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWHICYDT","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CWHICYDTPOCH6YV2KIFVTGNXHJ","target":"record","payload":{"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"},"canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","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"},"source_kind":"arxiv","source_id":"1604.07671","source_version":3,"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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIZECfrD+Evd238AmrtyOVhGNEUeMzuxX9HeR2PCMQiXY7astfeWry5lEwVCoo3gSgfSl6VXD7WdBDcbYF1GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:08:41.598993Z"},"content_sha256":"608539878d0ca230efb301d3f6cb93e6c51798693d65831bcaabf8f7afd85bc6","schema_version":"1.0","event_id":"sha256:608539878d0ca230efb301d3f6cb93e6c51798693d65831bcaabf8f7afd85bc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CWHICYDTPOCH6YV2KIFVTGNXHJ","target":"graph","payload":{"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"},"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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8l0BxvL9prLv/v5zvRc/Qo5JZnm76IKu3ii64uBJpuzNlRnYDGN+WHmW3xiyJUSbSOKKfbv27ZpwqW/q4zKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:08:41.599356Z"},"content_sha256":"a68e7b8e6d88539a4cc8e7268404ced4e4c7b4b09e8b56e78484c41d1aadfba5","schema_version":"1.0","event_id":"sha256:a68e7b8e6d88539a4cc8e7268404ced4e4c7b4b09e8b56e78484c41d1aadfba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/bundle.json","state_url":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/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-08T22:08:41Z","links":{"resolver":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ","bundle":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/bundle.json","state":"https://pith.science/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWHICYDTPOCH6YV2KIFVTGNXHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CWHICYDTPOCH6YV2KIFVTGNXHJ","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":"1dcfce3c64369165b9be2cbe6338ed7892c79f3440ee349f2b09e9efc40aba52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T13:29:48Z","title_canon_sha256":"d85bdcd1162a6aef0da0b261c9e6864706108d6e6c5ca1aa64dedade74934643"},"schema_version":"1.0","source":{"id":"1604.07671","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07671","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07671v3","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07671","created_at":"2026-05-18T00:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"CWHICYDTPOCH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWHICYDTPOCH6YV2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWHICYDT","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:a68e7b8e6d88539a4cc8e7268404ced4e4c7b4b09e8b56e78484c41d1aadfba5","target":"graph","created_at":"2026-05-18T00:07:28Z","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":"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 ","authors_text":"Chao Tian, Jie Li, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T13:29:48Z","title":"A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07671","kind":"arxiv","version":3},"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:608539878d0ca230efb301d3f6cb93e6c51798693d65831bcaabf8f7afd85bc6","target":"record","created_at":"2026-05-18T00:07:28Z","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":"1dcfce3c64369165b9be2cbe6338ed7892c79f3440ee349f2b09e9efc40aba52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-26T13:29:48Z","title_canon_sha256":"d85bdcd1162a6aef0da0b261c9e6864706108d6e6c5ca1aa64dedade74934643"},"schema_version":"1.0","source":{"id":"1604.07671","kind":"arxiv","version":3}},"canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"158e8160737b847f62ba520b5999b73a421f7bb278ec79c84733be655bde1b42","first_computed_at":"2026-05-18T00:07:28.605437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:28.605437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UKEgE8J6A+VLZfEgcFWekK44s+DscMmEzj8ogDyQginuLmDx3C5h40NdlYPo11qee++nR13a+A5QcXnM7R1DBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:28.605966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07671","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:608539878d0ca230efb301d3f6cb93e6c51798693d65831bcaabf8f7afd85bc6","sha256:a68e7b8e6d88539a4cc8e7268404ced4e4c7b4b09e8b56e78484c41d1aadfba5"],"state_sha256":"68f71c15c478a09689c8c7780ffd02aedbae627924b17e414413d2854e9523d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wud2G2I07uKehUoHHJ6Dx3Hwy/K1e8B2gSwBAynYP+ILG4EcPSLanU0NMsfikVod12+nHsjdrQtScXlumWAABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:08:41.601236Z","bundle_sha256":"e514c0d339509d7da1244f0d4e0db8ac4a131253060205ca9e3224ea8240b90f"}}