{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6WZHEM6H4VWFE6UCR2N7345LNH","short_pith_number":"pith:6WZHEM6H","schema_version":"1.0","canonical_sha256":"f5b27233c7e56c527a828e9bfdf3ab69f46fe3f94a105ad6bc44f6dc287d9822","source":{"kind":"arxiv","id":"1312.2135","version":1},"attestation_state":"computed","paper":{"title":"A Repair Framework for Scalar MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Giuseppe Caire, Karthikeyan Shanmugam","submitted_at":"2013-12-07T19:43:40Z","abstract_excerpt":"Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol after an erasure, referred to as repair bandwidth (BW). Vector codes allow communicating fewer sub-symbols per node, instead of the entire content. This allows non trivial savings in repair BW. In sharp contrast, classic codes, like Reed- Solomon (RS), used in current storage systems, are deemed to suffer from naive repair, i.e. downloading the entire stored message to repair one failed node. This mainly happens because "},"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":"1312.2135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T19:43:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a91304c719ba399a33610b754b92c038830599ccc41ffe1edfb95ab57d25e7f0","abstract_canon_sha256":"539fda5839c976dcb92c72b500450ea8422ae1327d14d4c711a881245587c8a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.462591Z","signature_b64":"HqDuK+yqRB+1FqjeFQZq6iLYE7l7Z9lJdrZYlZBlJvt4SVaTlXDCY2vWoY6R1OqE+rx6he3JAJTdtxnYnwEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b27233c7e56c527a828e9bfdf3ab69f46fe3f94a105ad6bc44f6dc287d9822","last_reissued_at":"2026-05-18T00:57:52.461832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.461832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Repair Framework for Scalar MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Giuseppe Caire, Karthikeyan Shanmugam","submitted_at":"2013-12-07T19:43:40Z","abstract_excerpt":"Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol after an erasure, referred to as repair bandwidth (BW). Vector codes allow communicating fewer sub-symbols per node, instead of the entire content. This allows non trivial savings in repair BW. In sharp contrast, classic codes, like Reed- Solomon (RS), used in current storage systems, are deemed to suffer from naive repair, i.e. downloading the entire stored message to repair one failed node. This mainly happens because "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2135","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":"1312.2135","created_at":"2026-05-18T00:57:52.461960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2135v1","created_at":"2026-05-18T00:57:52.461960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2135","created_at":"2026-05-18T00:57:52.461960+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WZHEM6H4VWF","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WZHEM6H4VWFE6UC","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WZHEM6H","created_at":"2026-05-18T12:27:36.564083+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/6WZHEM6H4VWFE6UCR2N7345LNH","json":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH.json","graph_json":"https://pith.science/api/pith-number/6WZHEM6H4VWFE6UCR2N7345LNH/graph.json","events_json":"https://pith.science/api/pith-number/6WZHEM6H4VWFE6UCR2N7345LNH/events.json","paper":"https://pith.science/paper/6WZHEM6H"},"agent_actions":{"view_html":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH","download_json":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH.json","view_paper":"https://pith.science/paper/6WZHEM6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2135&json=true","fetch_graph":"https://pith.science/api/pith-number/6WZHEM6H4VWFE6UCR2N7345LNH/graph.json","fetch_events":"https://pith.science/api/pith-number/6WZHEM6H4VWFE6UCR2N7345LNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH/action/storage_attestation","attest_author":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH/action/author_attestation","sign_citation":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH/action/citation_signature","submit_replication":"https://pith.science/pith/6WZHEM6H4VWFE6UCR2N7345LNH/action/replication_record"}},"created_at":"2026-05-18T00:57:52.461960+00:00","updated_at":"2026-05-18T00:57:52.461960+00:00"}