{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NONLD36CLTA2UKDWMNDLMOUNML","short_pith_number":"pith:NONLD36C","schema_version":"1.0","canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","source":{"kind":"arxiv","id":"1202.4423","version":1},"attestation_state":"computed","paper":{"title":"On the Reliability of RAID Systems: An Argument for More Check Drives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Marek Rychlik, Michael Anderson, Sarah Edge Mann","submitted_at":"2012-02-16T03:54:13Z","abstract_excerpt":"In this paper we address issues of reliability of RAID systems. We focus on \"big data\" systems with a large number of drives and advanced error correction schemes beyond \\RAID{6}. Our RAID paradigm is based on Reed-Solomon codes, and thus we assume that the RAID consists of $N$ data drives and $M$ check drives. The RAID fails only if the combined number of failed drives and sector errors exceeds $M$, a property of Reed-Solomon codes.\n  We review a number of models considered in the literature and build upon them to construct models usable for a large number of data and check drives. We attempt"},"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":"1202.4423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-02-16T03:54:13Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"52d226d2796a935781b695ccbd153c17e43ced56cc3a32d6370c539a4c042abb","abstract_canon_sha256":"46fcf32d7ef1155fb0ff1231dc96003c0de666c6238b9fe0fa288bf5bcef0b7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:51.589136Z","signature_b64":"TCsSysqhv08y9ljTVE4XJMweZ2yCM7wBiZPHFRWW/eQ6pmnYiTbyLqrrfMjWYXfyddQ02XQ8KGCzaevz5sCVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","last_reissued_at":"2026-05-18T04:01:51.588583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:51.588583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Reliability of RAID Systems: An Argument for More Check Drives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Marek Rychlik, Michael Anderson, Sarah Edge Mann","submitted_at":"2012-02-16T03:54:13Z","abstract_excerpt":"In this paper we address issues of reliability of RAID systems. We focus on \"big data\" systems with a large number of drives and advanced error correction schemes beyond \\RAID{6}. Our RAID paradigm is based on Reed-Solomon codes, and thus we assume that the RAID consists of $N$ data drives and $M$ check drives. The RAID fails only if the combined number of failed drives and sector errors exceeds $M$, a property of Reed-Solomon codes.\n  We review a number of models considered in the literature and build upon them to construct models usable for a large number of data and check drives. We attempt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4423","kind":"arxiv","version":1},"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":"1202.4423","created_at":"2026-05-18T04:01:51.588664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4423v1","created_at":"2026-05-18T04:01:51.588664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4423","created_at":"2026-05-18T04:01:51.588664+00:00"},{"alias_kind":"pith_short_12","alias_value":"NONLD36CLTA2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NONLD36CLTA2UKDW","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NONLD36C","created_at":"2026-05-18T12:27:16.716162+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/NONLD36CLTA2UKDWMNDLMOUNML","json":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML.json","graph_json":"https://pith.science/api/pith-number/NONLD36CLTA2UKDWMNDLMOUNML/graph.json","events_json":"https://pith.science/api/pith-number/NONLD36CLTA2UKDWMNDLMOUNML/events.json","paper":"https://pith.science/paper/NONLD36C"},"agent_actions":{"view_html":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML","download_json":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML.json","view_paper":"https://pith.science/paper/NONLD36C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4423&json=true","fetch_graph":"https://pith.science/api/pith-number/NONLD36CLTA2UKDWMNDLMOUNML/graph.json","fetch_events":"https://pith.science/api/pith-number/NONLD36CLTA2UKDWMNDLMOUNML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/action/storage_attestation","attest_author":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/action/author_attestation","sign_citation":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/action/citation_signature","submit_replication":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/action/replication_record"}},"created_at":"2026-05-18T04:01:51.588664+00:00","updated_at":"2026-05-18T04:01:51.588664+00:00"}