{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VM2JAV76ZQ7RUHAKH7PWF47H2T","short_pith_number":"pith:VM2JAV76","schema_version":"1.0","canonical_sha256":"ab349057fecc3f1a1c0a3fdf62f3e7d4e357573fc9ef5fe784681a3cad37c80c","source":{"kind":"arxiv","id":"1106.1634","version":1},"attestation_state":"computed","paper":{"title":"Repair Optimal Erasure Codes through Hadamard Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Viveck R. Cadambe","submitted_at":"2011-06-08T19:46:16Z","abstract_excerpt":"In distributed storage systems that employ erasure coding, the issue of minimizing the total {\\it communication} required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failure"},"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":"1106.1634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-08T19:46:16Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"68db9d6d55fc5780f3d646b46a6235ed04cbc35a713cbcee30ba08571abcb190","abstract_canon_sha256":"8984cdf7ec025f8d901c160ed6d8794ded84d8424b2352e3ffbedb27148066c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:22.619811Z","signature_b64":"Ol64RrD2rMGGzOaOlvG4NqJmUhaQbxpTSbv1e6iOpLUBXa0T4hadkcFw2s9j59wR5fZ0CEuzmTtZI/l7s9hOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab349057fecc3f1a1c0a3fdf62f3e7d4e357573fc9ef5fe784681a3cad37c80c","last_reissued_at":"2026-05-18T04:20:22.619269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:22.619269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repair Optimal Erasure Codes through Hadamard Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Viveck R. Cadambe","submitted_at":"2011-06-08T19:46:16Z","abstract_excerpt":"In distributed storage systems that employ erasure coding, the issue of minimizing the total {\\it communication} required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1634","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":"1106.1634","created_at":"2026-05-18T04:20:22.619366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1634v1","created_at":"2026-05-18T04:20:22.619366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1634","created_at":"2026-05-18T04:20:22.619366+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM2JAV76ZQ7R","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM2JAV76ZQ7RUHAK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM2JAV76","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/VM2JAV76ZQ7RUHAKH7PWF47H2T","json":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T.json","graph_json":"https://pith.science/api/pith-number/VM2JAV76ZQ7RUHAKH7PWF47H2T/graph.json","events_json":"https://pith.science/api/pith-number/VM2JAV76ZQ7RUHAKH7PWF47H2T/events.json","paper":"https://pith.science/paper/VM2JAV76"},"agent_actions":{"view_html":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T","download_json":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T.json","view_paper":"https://pith.science/paper/VM2JAV76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1634&json=true","fetch_graph":"https://pith.science/api/pith-number/VM2JAV76ZQ7RUHAKH7PWF47H2T/graph.json","fetch_events":"https://pith.science/api/pith-number/VM2JAV76ZQ7RUHAKH7PWF47H2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T/action/storage_attestation","attest_author":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T/action/author_attestation","sign_citation":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T/action/citation_signature","submit_replication":"https://pith.science/pith/VM2JAV76ZQ7RUHAKH7PWF47H2T/action/replication_record"}},"created_at":"2026-05-18T04:20:22.619366+00:00","updated_at":"2026-05-18T04:20:22.619366+00:00"}