{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KKHY6WE43BQBWCADXOMA2RRG7I","short_pith_number":"pith:KKHY6WE4","schema_version":"1.0","canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","source":{"kind":"arxiv","id":"1604.00454","version":2},"attestation_state":"computed","paper":{"title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-04-02T03:16:54Z","abstract_excerpt":"Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is used to encode data in a distributed storage system. It is known that if $h$ out of the $n$ nodes are inaccessible and $d$ surviving (helper) nodes are used to recover the lost data, then we need to download at least $h/(d+h-k)$ fraction of the data stored in each of the helper nodes (Dimakis et. al., 2010 and Cadambe et al., 2013). If this lower "},"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.00454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b9f827e34c9b71f927bbbd8d2d4ddcc00a7505abb1ca06c689ddd0c4de0ec9a","abstract_canon_sha256":"7dff949d4be1eea48a14d17f54adb4a0f71ee8ae31b20c11d64fc09a29a58df5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:28.426782Z","signature_b64":"wDg4KwbppMlP9zdAsWkQLscUNFSAQXM++eb19fYTB4Woaj/YikQvlXNvRjegpNLCMPb6RIM9k1btqUmwpkoKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","last_reissued_at":"2026-05-18T01:17:28.426147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:28.426147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-04-02T03:16:54Z","abstract_excerpt":"Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is used to encode data in a distributed storage system. It is known that if $h$ out of the $n$ nodes are inaccessible and $d$ surviving (helper) nodes are used to recover the lost data, then we need to download at least $h/(d+h-k)$ fraction of the data stored in each of the helper nodes (Dimakis et. al., 2010 and Cadambe et al., 2013). If this lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00454","kind":"arxiv","version":2},"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.00454","created_at":"2026-05-18T01:17:28.426243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00454v2","created_at":"2026-05-18T01:17:28.426243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00454","created_at":"2026-05-18T01:17:28.426243+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKHY6WE43BQB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKHY6WE43BQBWCAD","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKHY6WE4","created_at":"2026-05-18T12:30:25.849896+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/KKHY6WE43BQBWCADXOMA2RRG7I","json":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I.json","graph_json":"https://pith.science/api/pith-number/KKHY6WE43BQBWCADXOMA2RRG7I/graph.json","events_json":"https://pith.science/api/pith-number/KKHY6WE43BQBWCADXOMA2RRG7I/events.json","paper":"https://pith.science/paper/KKHY6WE4"},"agent_actions":{"view_html":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I","download_json":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I.json","view_paper":"https://pith.science/paper/KKHY6WE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00454&json=true","fetch_graph":"https://pith.science/api/pith-number/KKHY6WE43BQBWCADXOMA2RRG7I/graph.json","fetch_events":"https://pith.science/api/pith-number/KKHY6WE43BQBWCADXOMA2RRG7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/action/storage_attestation","attest_author":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/action/author_attestation","sign_citation":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/action/citation_signature","submit_replication":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/action/replication_record"}},"created_at":"2026-05-18T01:17:28.426243+00:00","updated_at":"2026-05-18T01:17:28.426243+00:00"}