{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K6RMOG7UTTVQ7W26XVF5PTITMW","short_pith_number":"pith:K6RMOG7U","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"},"canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","source":{"kind":"arxiv","id":"1310.2381","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2381","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2381v3","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2381","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"K6RMOG7UTTVQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K6RMOG7UTTVQ7W26","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K6RMOG7U","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K6RMOG7UTTVQ7W26XVF5PTITMW","target":"record","payload":{"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"},"canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","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"},"source_kind":"arxiv","source_id":"1310.2381","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-18T02:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0keMlHfN/F2IZQX4dB6dlizZh63yuaXGeqhbEttIq1aQyAhc9pWvP9o+xXLCVolS2atW1GwG2YBdLaHEYQ6FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:19:22.914391Z"},"content_sha256":"eadd0ff358a4a7b21c9814a1d333f8682e6eaf3287fefa07d3fa0ef8d32e82b5","schema_version":"1.0","event_id":"sha256:eadd0ff358a4a7b21c9814a1d333f8682e6eaf3287fefa07d3fa0ef8d32e82b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K6RMOG7UTTVQ7W26XVF5PTITMW","target":"graph","payload":{"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"},"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-18T02:51:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mysa/BBRMmy2RbS/XdFVn6fUkcD74uuOH15f+JC/sst75x/Eo5VU9ekVXfp3F/muDZRg8cCpUBvaPOXo2gSiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:19:22.914754Z"},"content_sha256":"79885bb88ca5fde2765597852ed3b4af3bcf81ec6c37ba32e09ee1e4ea03145a","schema_version":"1.0","event_id":"sha256:79885bb88ca5fde2765597852ed3b4af3bcf81ec6c37ba32e09ee1e4ea03145a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/bundle.json","state_url":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/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-01T05:19:22Z","links":{"resolver":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW","bundle":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/bundle.json","state":"https://pith.science/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6RMOG7UTTVQ7W26XVF5PTITMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K6RMOG7UTTVQ7W26XVF5PTITMW","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":"317f2dbb8c8935ebe2d7a976755ac7d3ccd1b65b59cdddb9eb82de7e5e6f920f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-09T07:36:52Z","title_canon_sha256":"f64e93d0f24aac522f71a802efb6fb02972554461f0f6ca30093677dbbaae5db"},"schema_version":"1.0","source":{"id":"1310.2381","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2381","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2381v3","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2381","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"K6RMOG7UTTVQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K6RMOG7UTTVQ7W26","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K6RMOG7U","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:79885bb88ca5fde2765597852ed3b4af3bcf81ec6c37ba32e09ee1e4ea03145a","target":"graph","created_at":"2026-05-18T02:51:42Z","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":"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","authors_text":"Xin Wang, Xunrui Yin, Yan Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-09T07:36:52Z","title":"MDR Codes: A New Class of RAID-6 Codes with Optimal Rebuilding and Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2381","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:eadd0ff358a4a7b21c9814a1d333f8682e6eaf3287fefa07d3fa0ef8d32e82b5","target":"record","created_at":"2026-05-18T02:51:42Z","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":"317f2dbb8c8935ebe2d7a976755ac7d3ccd1b65b59cdddb9eb82de7e5e6f920f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-09T07:36:52Z","title_canon_sha256":"f64e93d0f24aac522f71a802efb6fb02972554461f0f6ca30093677dbbaae5db"},"schema_version":"1.0","source":{"id":"1310.2381","kind":"arxiv","version":3}},"canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57a2c71bf49ceb0fdb5ebd4bd7cd1365ae2766ebbdab8222c6a64a0c605b3dec","first_computed_at":"2026-05-18T02:51:42.045559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:42.045559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8oTiZm4w02mkxAZbL1N5lqV9Wtc7rtuT65XG5MaEy6iWf2gVL3QYUUArwE+rqGuxXsGBkUe2Yuqug6TT/dNLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:42.046048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2381","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eadd0ff358a4a7b21c9814a1d333f8682e6eaf3287fefa07d3fa0ef8d32e82b5","sha256:79885bb88ca5fde2765597852ed3b4af3bcf81ec6c37ba32e09ee1e4ea03145a"],"state_sha256":"dd14273f2e957c72d09154b6f26fc49ded12bd681a64bc4b1a82e19976bf3c23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCTVtJlq1TW5T0JpYPP0xacdAiKnC/m4+zi78l3VMyhqV94cAWbCMaLmlwUAdvG3MFNGr9B2KGvLiGXBl/1JAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:19:22.916760Z","bundle_sha256":"00a92b5a20fdfabd02e19f1621a4c64dba09c731cc5b6903fc4f4b98c790ea0e"}}