{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4EOKVY75FEWSZMHDY2BCTQ35QV","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":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6"},"schema_version":"1.0","source":{"id":"1305.3498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3498v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3498","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"4EOKVY75FEWS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4EOKVY75FEWSZMHD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4EOKVY75","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9","target":"graph","created_at":"2026-05-18T03:25:35Z","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":"Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$ disks. However, access to at least $k$ disks is still required to repair a single erasure. To reduce repair bandwidth, array codes are used where the stored symbols or packets are vectors of length $\\ell$. MDS array codes have the potential to repair a single erasure using a fraction $1/(n-k)$ of data stored in the remaining disks. We introduce new methods of a","authors_text":"Itzhak Tamo, Robert Calderbank, Sreechakra Goparaju","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title":"An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3498","kind":"arxiv","version":1},"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:88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb","target":"record","created_at":"2026-05-18T03:25:35Z","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":"040978f52d739dfb996ac6a794761f0ac69960d3e82f53c07ddc935528e26357","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T14:40:37Z","title_canon_sha256":"e3bb8b39159417d05aaaca1df0b5c3c5304304e012dd18e73a157516d2e9b1d6"},"schema_version":"1.0","source":{"id":"1305.3498","kind":"arxiv","version":1}},"canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e11caae3fd292d2cb0e3c68229c37d8576164d2fcaa5b7df79a5b5730570ee7b","first_computed_at":"2026-05-18T03:25:35.652876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.652876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t6/bAcCYNY7Ta2qYfi3NC1fG9dtgvI/CBUU9M4Pfk4bRZy89gsONNUSOQUZ6usr9bgh/EQxNVeUUO09NPc9yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.653500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88dd6b2a90175ff13e27a0ad295a32ec4cf91e32feb6bd8a94bc27cbead7aecb","sha256:b216e27b0e9fa78fef88dc2272d730986e31acf38017caef7fa35e97d0de69a9"],"state_sha256":"ad83cc4e254f8fb325aea740730acdd98697bb3593f10bd02182fe5faaabeb25"}