{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NONLD36CLTA2UKDWMNDLMOUNML","short_pith_number":"pith:NONLD36C","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"},"canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","source":{"kind":"arxiv","id":"1202.4423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4423","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4423v1","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4423","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"NONLD36CLTA2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NONLD36CLTA2UKDW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NONLD36C","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NONLD36CLTA2UKDWMNDLMOUNML","target":"record","payload":{"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"},"canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","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"},"source_kind":"arxiv","source_id":"1202.4423","source_version":1,"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-18T04:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIgdKWRhhkJ7Gx04fCIf+Du7qDrYHebkG452smyWCGHvklMPNEywz8cCF7UFL30yXfDKIwzrdQp08GfEE1D5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:08:22.214502Z"},"content_sha256":"efe8a88dcafd05e1924fd7a3eb0db387f2d0aa9732ab9344c8b248d22e6fe767","schema_version":"1.0","event_id":"sha256:efe8a88dcafd05e1924fd7a3eb0db387f2d0aa9732ab9344c8b248d22e6fe767"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NONLD36CLTA2UKDWMNDLMOUNML","target":"graph","payload":{"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"},"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-18T04:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLSXLoTOWadzcb08TrlEm4zobpzW5JJy6hX2r7GzYU+EM2mXhSLHkys0X8scTLvJTOn5oHoiFrh3v0dEW3SnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:08:22.215177Z"},"content_sha256":"caba5447641a01e564d82235db518ee1ac360b3af2d1d8c634aba7a77595578f","schema_version":"1.0","event_id":"sha256:caba5447641a01e564d82235db518ee1ac360b3af2d1d8c634aba7a77595578f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/bundle.json","state_url":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NONLD36CLTA2UKDWMNDLMOUNML/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-05-27T06:08:22Z","links":{"resolver":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML","bundle":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/bundle.json","state":"https://pith.science/pith/NONLD36CLTA2UKDWMNDLMOUNML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NONLD36CLTA2UKDWMNDLMOUNML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NONLD36CLTA2UKDWMNDLMOUNML","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":"46fcf32d7ef1155fb0ff1231dc96003c0de666c6238b9fe0fa288bf5bcef0b7b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-02-16T03:54:13Z","title_canon_sha256":"52d226d2796a935781b695ccbd153c17e43ced56cc3a32d6370c539a4c042abb"},"schema_version":"1.0","source":{"id":"1202.4423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4423","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4423v1","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4423","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"NONLD36CLTA2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NONLD36CLTA2UKDW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NONLD36C","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:caba5447641a01e564d82235db518ee1ac360b3af2d1d8c634aba7a77595578f","target":"graph","created_at":"2026-05-18T04:01:51Z","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":"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","authors_text":"Marek Rychlik, Michael Anderson, Sarah Edge Mann","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-02-16T03:54:13Z","title":"On the Reliability of RAID Systems: An Argument for More Check Drives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4423","kind":"arxiv","version":1},"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:efe8a88dcafd05e1924fd7a3eb0db387f2d0aa9732ab9344c8b248d22e6fe767","target":"record","created_at":"2026-05-18T04:01:51Z","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":"46fcf32d7ef1155fb0ff1231dc96003c0de666c6238b9fe0fa288bf5bcef0b7b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-02-16T03:54:13Z","title_canon_sha256":"52d226d2796a935781b695ccbd153c17e43ced56cc3a32d6370c539a4c042abb"},"schema_version":"1.0","source":{"id":"1202.4423","kind":"arxiv","version":1}},"canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b9ab1efc25cc1aa28766346b63a8d62c35e1b94d7c5985efda91a315e63415c","first_computed_at":"2026-05-18T04:01:51.588583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:51.588583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TCsSysqhv08y9ljTVE4XJMweZ2yCM7wBiZPHFRWW/eQ6pmnYiTbyLqrrfMjWYXfyddQ02XQ8KGCzaevz5sCVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:51.589136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efe8a88dcafd05e1924fd7a3eb0db387f2d0aa9732ab9344c8b248d22e6fe767","sha256:caba5447641a01e564d82235db518ee1ac360b3af2d1d8c634aba7a77595578f"],"state_sha256":"317eff927363abdba26ca9fd51805c291c4253c51a90190e37464ac18a602709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKgKjXdYdcVhbtFj/OjjqPP6/5DMhlz7gbYpKUMG4vIlsgsR4jlaLBZhWfnzFmvXGe4LY3QRA5M4lx4nC7TbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:08:22.218089Z","bundle_sha256":"f1f27caeed86f7a5367a1f16be8690fd39a8b91d6cc4c217a350268d782a8934"}}