{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YQP7RAJ5ZLDIL6WIEWOWJO3SYD","short_pith_number":"pith:YQP7RAJ5","schema_version":"1.0","canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","source":{"kind":"arxiv","id":"1806.08266","version":2},"attestation_state":"computed","paper":{"title":"Beyond RAID 6 --- an Efficient Systematic Code Protecting Against Multiple Errors, Erasures, and Silent Data Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Marek Rychlik, Mohamad Moussa","submitted_at":"2018-06-21T14:29:47Z","abstract_excerpt":"We describe a replacement for RAID 6, based on a new linear, systematic code, which detects and corrects any combination of $E$ errors (unknown location) and $Z$ erasures (known location) provided that $Z+2E \\leq 4$. We investigate some scenarios for error correction beyond the code's minimum distance, using list decoding. We describe a decoding algorithm with quasi-logarithmic time complexity, when parallel processing is used: $\\approx O(\\log N)$ where $N$ is the number of disks in the array (similar to RAID 6).\n  By comparison, the error correcting code implemented by RAID 6 allows error det"},"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":"1806.08266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-21T14:29:47Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"de81fcf23985d60ceba6e0250e4b5d32fa63a65b52427eff8957e3bfb172aae9","abstract_canon_sha256":"0348d863a2c50141e81f2e567526fc079fd57d21c7e3d1bbab89b740fe2e1287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:23.135082Z","signature_b64":"V8TVvvUIwXZdVmnvZsl8a+/FQU3k3sJai9i6ggNJytVmdOBOU+HrekjiuKTyLZSzDTk4+h93Ba+KuefR+T6GDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","last_reissued_at":"2026-05-18T00:11:23.134655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:23.134655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond RAID 6 --- an Efficient Systematic Code Protecting Against Multiple Errors, Erasures, and Silent Data Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Marek Rychlik, Mohamad Moussa","submitted_at":"2018-06-21T14:29:47Z","abstract_excerpt":"We describe a replacement for RAID 6, based on a new linear, systematic code, which detects and corrects any combination of $E$ errors (unknown location) and $Z$ erasures (known location) provided that $Z+2E \\leq 4$. We investigate some scenarios for error correction beyond the code's minimum distance, using list decoding. We describe a decoding algorithm with quasi-logarithmic time complexity, when parallel processing is used: $\\approx O(\\log N)$ where $N$ is the number of disks in the array (similar to RAID 6).\n  By comparison, the error correcting code implemented by RAID 6 allows error det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08266","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":"1806.08266","created_at":"2026-05-18T00:11:23.134723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08266v2","created_at":"2026-05-18T00:11:23.134723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08266","created_at":"2026-05-18T00:11:23.134723+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQP7RAJ5ZLDI","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQP7RAJ5ZLDIL6WI","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQP7RAJ5","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00376","citing_title":"Decoding Algorithms for Symbol-Error Correction in MDS Array Codes via Superregular Matrices","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD","json":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD.json","graph_json":"https://pith.science/api/pith-number/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/graph.json","events_json":"https://pith.science/api/pith-number/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/events.json","paper":"https://pith.science/paper/YQP7RAJ5"},"agent_actions":{"view_html":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD","download_json":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD.json","view_paper":"https://pith.science/paper/YQP7RAJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08266&json=true","fetch_graph":"https://pith.science/api/pith-number/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/graph.json","fetch_events":"https://pith.science/api/pith-number/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/action/storage_attestation","attest_author":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/action/author_attestation","sign_citation":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/action/citation_signature","submit_replication":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/action/replication_record"}},"created_at":"2026-05-18T00:11:23.134723+00:00","updated_at":"2026-05-18T00:11:23.134723+00:00"}