{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WBQNCEDHHOZFN4FX47ZFGKIPX2","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":"5fd6c07682b5baff3aeb1aa827facf6eea94466993ed655605156be5aa403294","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-13T16:51:36Z","title_canon_sha256":"d5249de39deb29234f8001ca22f176110ed05bad28178a44cfd5ca4c74c973e7"},"schema_version":"1.0","source":{"id":"1104.2547","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2547","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2547v5","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2547","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"WBQNCEDHHOZF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WBQNCEDHHOZFN4FX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WBQNCEDH","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:4dddbb736e45aebab501f52b2b4d07d551e5cf4be4e9ff2b722b9af021fea655","target":"graph","created_at":"2026-05-18T02:22:09Z","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":"The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying connections between C-Codes (or quasi-C-Codes) and starters in group theory are revealed. It is shown that each C-Code (or quasi-C-Code) of length $2n$ can be constructed using an even starter (or even multi-starter) in $(Z_{2n},+)$. It is also shown that each C-Code (or quasi-C-Code) has a twin C-Code (or quasi-C-Code). Then, four infinite families (three o","authors_text":"Jiwu Shu, Mingqiang Li","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-13T16:51:36Z","title":"C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2547","kind":"arxiv","version":5},"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:678dbd04d0721db8dbcf34fd6ac835a74c05c08b8d17f6e4a96e9dc96944a8e0","target":"record","created_at":"2026-05-18T02:22:09Z","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":"5fd6c07682b5baff3aeb1aa827facf6eea94466993ed655605156be5aa403294","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-13T16:51:36Z","title_canon_sha256":"d5249de39deb29234f8001ca22f176110ed05bad28178a44cfd5ca4c74c973e7"},"schema_version":"1.0","source":{"id":"1104.2547","kind":"arxiv","version":5}},"canonical_sha256":"b060d110673bb256f0b7e7f253290fbe8a634d25f0b453f81f9276bc633efb3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b060d110673bb256f0b7e7f253290fbe8a634d25f0b453f81f9276bc633efb3b","first_computed_at":"2026-05-18T02:22:09.344593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:09.344593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ro8O1suYMZilmCz1kouyYZz9fkFKCIyyhxlO3TryYuXKBCHvy3+j+umk9IfDdxJ8WYJy+O7W3NGIxGAihghWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:09.345140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2547","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:678dbd04d0721db8dbcf34fd6ac835a74c05c08b8d17f6e4a96e9dc96944a8e0","sha256:4dddbb736e45aebab501f52b2b4d07d551e5cf4be4e9ff2b722b9af021fea655"],"state_sha256":"b4f4401a028f41fddb80de266ba47d63ab92ef54de2f0a88db791c3f0b437d1c"}