{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BMOA5ULA2CEJWXE4EOTVFFT5KY","short_pith_number":"pith:BMOA5ULA","schema_version":"1.0","canonical_sha256":"0b1c0ed160d0889b5c9c23a752967d5617ed987deec638bad6ff75f51b42c088","source":{"kind":"arxiv","id":"1803.03508","version":1},"attestation_state":"computed","paper":{"title":"A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Hui Li, Kenneth W. Shum, Yunghsiang S. Han","submitted_at":"2018-03-09T13:53:41Z","abstract_excerpt":"Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks increases, better fault tolerance by using array codes with three or more parity disks is needed. Although many extensions of RDP codes and EVENODD codes have been proposed, the high decoding complexity is the main drawback of them. In this paper, we present a new construction for all families of EVENODD codes and RDP codes, and propose a unified form of them"},"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":"1803.03508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-09T13:53:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"793d86d800acd6d4f516c0659a6e68a8e91154c895db9da20765a1fb4059725d","abstract_canon_sha256":"88948fc975a21ba25a26b55f29c8a613e9c4aa34c524df8d923cdb0264224ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:39.324195Z","signature_b64":"xVf7m9P4Z0hlS9yY/UAGVBuL1Dt3DYDtuWae4hdztb7VDJHDWNzdY6yZgtkRpGhZU00thJryMUDQBcZxCALEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1c0ed160d0889b5c9c23a752967d5617ed987deec638bad6ff75f51b42c088","last_reissued_at":"2026-05-18T00:21:39.323473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:39.323473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Hui Li, Kenneth W. Shum, Yunghsiang S. Han","submitted_at":"2018-03-09T13:53:41Z","abstract_excerpt":"Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks increases, better fault tolerance by using array codes with three or more parity disks is needed. Although many extensions of RDP codes and EVENODD codes have been proposed, the high decoding complexity is the main drawback of them. In this paper, we present a new construction for all families of EVENODD codes and RDP codes, and propose a unified form of them"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03508","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":"1803.03508","created_at":"2026-05-18T00:21:39.323592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03508v1","created_at":"2026-05-18T00:21:39.323592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03508","created_at":"2026-05-18T00:21:39.323592+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMOA5ULA2CEJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMOA5ULA2CEJWXE4","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMOA5ULA","created_at":"2026-05-18T12:32:16.446611+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/BMOA5ULA2CEJWXE4EOTVFFT5KY","json":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY.json","graph_json":"https://pith.science/api/pith-number/BMOA5ULA2CEJWXE4EOTVFFT5KY/graph.json","events_json":"https://pith.science/api/pith-number/BMOA5ULA2CEJWXE4EOTVFFT5KY/events.json","paper":"https://pith.science/paper/BMOA5ULA"},"agent_actions":{"view_html":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY","download_json":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY.json","view_paper":"https://pith.science/paper/BMOA5ULA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03508&json=true","fetch_graph":"https://pith.science/api/pith-number/BMOA5ULA2CEJWXE4EOTVFFT5KY/graph.json","fetch_events":"https://pith.science/api/pith-number/BMOA5ULA2CEJWXE4EOTVFFT5KY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY/action/storage_attestation","attest_author":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY/action/author_attestation","sign_citation":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY/action/citation_signature","submit_replication":"https://pith.science/pith/BMOA5ULA2CEJWXE4EOTVFFT5KY/action/replication_record"}},"created_at":"2026-05-18T00:21:39.323592+00:00","updated_at":"2026-05-18T00:21:39.323592+00:00"}