{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WBQNCEDHHOZFN4FX47ZFGKIPX2","short_pith_number":"pith:WBQNCEDH","schema_version":"1.0","canonical_sha256":"b060d110673bb256f0b7e7f253290fbe8a634d25f0b453f81f9276bc633efb3b","source":{"kind":"arxiv","id":"1104.2547","version":5},"attestation_state":"computed","paper":{"title":"C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jiwu Shu, Mingqiang Li","submitted_at":"2011-04-13T16:51:36Z","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"},"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":"1104.2547","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-13T16:51:36Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"d5249de39deb29234f8001ca22f176110ed05bad28178a44cfd5ca4c74c973e7","abstract_canon_sha256":"5fd6c07682b5baff3aeb1aa827facf6eea94466993ed655605156be5aa403294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.345140Z","signature_b64":"ro8O1suYMZilmCz1kouyYZz9fkFKCIyyhxlO3TryYuXKBCHvy3+j+umk9IfDdxJ8WYJy+O7W3NGIxGAihghWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b060d110673bb256f0b7e7f253290fbe8a634d25f0b453f81f9276bc633efb3b","last_reissued_at":"2026-05-18T02:22:09.344593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.344593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jiwu Shu, Mingqiang Li","submitted_at":"2011-04-13T16:51:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2547","kind":"arxiv","version":5},"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":"1104.2547","created_at":"2026-05-18T02:22:09.344689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2547v5","created_at":"2026-05-18T02:22:09.344689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2547","created_at":"2026-05-18T02:22:09.344689+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBQNCEDHHOZF","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBQNCEDHHOZFN4FX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBQNCEDH","created_at":"2026-05-18T12:26:44.992195+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/WBQNCEDHHOZFN4FX47ZFGKIPX2","json":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2.json","graph_json":"https://pith.science/api/pith-number/WBQNCEDHHOZFN4FX47ZFGKIPX2/graph.json","events_json":"https://pith.science/api/pith-number/WBQNCEDHHOZFN4FX47ZFGKIPX2/events.json","paper":"https://pith.science/paper/WBQNCEDH"},"agent_actions":{"view_html":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2","download_json":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2.json","view_paper":"https://pith.science/paper/WBQNCEDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2547&json=true","fetch_graph":"https://pith.science/api/pith-number/WBQNCEDHHOZFN4FX47ZFGKIPX2/graph.json","fetch_events":"https://pith.science/api/pith-number/WBQNCEDHHOZFN4FX47ZFGKIPX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2/action/storage_attestation","attest_author":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2/action/author_attestation","sign_citation":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2/action/citation_signature","submit_replication":"https://pith.science/pith/WBQNCEDHHOZFN4FX47ZFGKIPX2/action/replication_record"}},"created_at":"2026-05-18T02:22:09.344689+00:00","updated_at":"2026-05-18T02:22:09.344689+00:00"}