{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YQP7RAJ5ZLDIL6WIEWOWJO3SYD","short_pith_number":"pith:YQP7RAJ5","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"},"canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","source":{"kind":"arxiv","id":"1806.08266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08266","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08266v2","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08266","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"YQP7RAJ5ZLDI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YQP7RAJ5ZLDIL6WI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YQP7RAJ5","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YQP7RAJ5ZLDIL6WIEWOWJO3SYD","target":"record","payload":{"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"},"canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","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"},"source_kind":"arxiv","source_id":"1806.08266","source_version":2,"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-18T00:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crghSvaLYT+ChGomHf+U1QGvySVDiSKW7oAQfkzCdnx0G3qju+QxRZWhMMlBo6CMPTCeJ1/5qNNDQGB7aWj2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:11:17.957082Z"},"content_sha256":"3d951096938d1a895dd765490329d620544097b6e387c9f567eaf00bbb87fc72","schema_version":"1.0","event_id":"sha256:3d951096938d1a895dd765490329d620544097b6e387c9f567eaf00bbb87fc72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YQP7RAJ5ZLDIL6WIEWOWJO3SYD","target":"graph","payload":{"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"},"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-18T00:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQSQOVpALXUB3C9Tkha21TULfggX3l2surJDWIPW66kN/S1VOzyRIgb9fXzqhVX6xLegRGoWa7Y5LK6LSgSbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:11:17.957642Z"},"content_sha256":"4fef80455f98abcfe466baff7e6d87e03b105ed904cb5bd8275e1b8eb398bff1","schema_version":"1.0","event_id":"sha256:4fef80455f98abcfe466baff7e6d87e03b105ed904cb5bd8275e1b8eb398bff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/bundle.json","state_url":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/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-11T00:11:17Z","links":{"resolver":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD","bundle":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/bundle.json","state":"https://pith.science/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQP7RAJ5ZLDIL6WIEWOWJO3SYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YQP7RAJ5ZLDIL6WIEWOWJO3SYD","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":"0348d863a2c50141e81f2e567526fc079fd57d21c7e3d1bbab89b740fe2e1287","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-21T14:29:47Z","title_canon_sha256":"de81fcf23985d60ceba6e0250e4b5d32fa63a65b52427eff8957e3bfb172aae9"},"schema_version":"1.0","source":{"id":"1806.08266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08266","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08266v2","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08266","created_at":"2026-05-18T00:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"YQP7RAJ5ZLDI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YQP7RAJ5ZLDIL6WI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YQP7RAJ5","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:4fef80455f98abcfe466baff7e6d87e03b105ed904cb5bd8275e1b8eb398bff1","target":"graph","created_at":"2026-05-18T00:11:23Z","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":"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","authors_text":"Marek Rychlik, Mohamad Moussa","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-21T14:29:47Z","title":"Beyond RAID 6 --- an Efficient Systematic Code Protecting Against Multiple Errors, Erasures, and Silent Data Corruption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08266","kind":"arxiv","version":2},"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:3d951096938d1a895dd765490329d620544097b6e387c9f567eaf00bbb87fc72","target":"record","created_at":"2026-05-18T00:11:23Z","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":"0348d863a2c50141e81f2e567526fc079fd57d21c7e3d1bbab89b740fe2e1287","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-21T14:29:47Z","title_canon_sha256":"de81fcf23985d60ceba6e0250e4b5d32fa63a65b52427eff8957e3bfb172aae9"},"schema_version":"1.0","source":{"id":"1806.08266","kind":"arxiv","version":2}},"canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c41ff8813dcac685fac8259d64bb72c0cb13c106cf786fbfcd6a4895170cde71","first_computed_at":"2026-05-18T00:11:23.134655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:23.134655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8TVvvUIwXZdVmnvZsl8a+/FQU3k3sJai9i6ggNJytVmdOBOU+HrekjiuKTyLZSzDTk4+h93Ba+KuefR+T6GDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:23.135082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d951096938d1a895dd765490329d620544097b6e387c9f567eaf00bbb87fc72","sha256:4fef80455f98abcfe466baff7e6d87e03b105ed904cb5bd8275e1b8eb398bff1"],"state_sha256":"36b27dad258ee2dd88bbb1a651e25dd4367006f74867d64ac4e7c334ed70a4e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhdPqhEsltmlp+mMo+EBlJVbCdXgoYJfYqBuFYBU0NfVLt2sLfeJKXUdvT+7spZt7KLwKbEVIjm7m6GSq1MHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:11:17.961260Z","bundle_sha256":"a4fd6305bf0cc445d3727b8fb318d1d3a23d5cea04a171cb66f7999f4a216a58"}}