{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K6RMOG7UTTVQ7W26XVF5PTITMW","short_pith_number":"pith:K6RMOG7U","schema_version":"1.0","canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","source":{"kind":"arxiv","id":"1310.2381","version":3},"attestation_state":"computed","paper":{"title":"MDR Codes: A New Class of RAID-6 Codes with Optimal Rebuilding and Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xin Wang, Xunrui Yin, Yan Wang","submitted_at":"2013-10-09T07:36:52Z","abstract_excerpt":"As storage systems grow in size, device failures happen more frequently than ever before. Given the commodity nature of hard drives employed, a storage system needs to tolerate a certain number of disk failures while maintaining data integrity, and to recover lost data with minimal interference to normal disk I/O operations. RAID-6, which can tolerate up to two disk failures with the minimum redundancy, is becoming widespread. However, traditional RAID-6 codes suffer from high disk I/O overhead during recovery. In this paper, we propose a new family of RAID-6 codes, the Minimum Disk I/O Repair"},"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":"1310.2381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-09T07:36:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f64e93d0f24aac522f71a802efb6fb02972554461f0f6ca30093677dbbaae5db","abstract_canon_sha256":"317f2dbb8c8935ebe2d7a976755ac7d3ccd1b65b59cdddb9eb82de7e5e6f920f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.046048Z","signature_b64":"8oTiZm4w02mkxAZbL1N5lqV9Wtc7rtuT65XG5MaEy6iWf2gVL3QYUUArwE+rqGuxXsGBkUe2Yuqug6TT/dNLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","last_reissued_at":"2026-05-18T02:51:42.045559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.045559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MDR Codes: A New Class of RAID-6 Codes with Optimal Rebuilding and Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xin Wang, Xunrui Yin, Yan Wang","submitted_at":"2013-10-09T07:36:52Z","abstract_excerpt":"As storage systems grow in size, device failures happen more frequently than ever before. Given the commodity nature of hard drives employed, a storage system needs to tolerate a certain number of disk failures while maintaining data integrity, and to recover lost data with minimal interference to normal disk I/O operations. RAID-6, which can tolerate up to two disk failures with the minimum redundancy, is becoming widespread. However, traditional RAID-6 codes suffer from high disk I/O overhead during recovery. In this paper, we propose a new family of RAID-6 codes, the Minimum Disk I/O Repair"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2381","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":"1310.2381","created_at":"2026-05-18T02:51:42.045623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2381v3","created_at":"2026-05-18T02:51:42.045623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2381","created_at":"2026-05-18T02:51:42.045623+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6RMOG7UTTVQ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6RMOG7UTTVQ7W26","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6RMOG7U","created_at":"2026-05-18T12:27:49.015174+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/K6RMOG7UTTVQ7W26XVF5PTITMW","json":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW.json","graph_json":"https://pith.science/api/pith-number/K6RMOG7UTTVQ7W26XVF5PTITMW/graph.json","events_json":"https://pith.science/api/pith-number/K6RMOG7UTTVQ7W26XVF5PTITMW/events.json","paper":"https://pith.science/paper/K6RMOG7U"},"agent_actions":{"view_html":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW","download_json":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW.json","view_paper":"https://pith.science/paper/K6RMOG7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2381&json=true","fetch_graph":"https://pith.science/api/pith-number/K6RMOG7UTTVQ7W26XVF5PTITMW/graph.json","fetch_events":"https://pith.science/api/pith-number/K6RMOG7UTTVQ7W26XVF5PTITMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/action/storage_attestation","attest_author":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/action/author_attestation","sign_citation":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/action/citation_signature","submit_replication":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/action/replication_record"}},"created_at":"2026-05-18T02:51:42.045623+00:00","updated_at":"2026-05-18T02:51:42.045623+00:00"}