{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DV6D5GVGSB23UN2YYKEBPTIDEW","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":"5a11c56b0ab4721fa8c56e8ea7f1a2882d50b43686f1c22671f936c8bc920379","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-11T13:47:04Z","title_canon_sha256":"f0abb52e3bbd9780eacacbe19df79cfb9895f7fab281a8a95ef614d0fdad3acc"},"schema_version":"1.0","source":{"id":"1301.2497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2497","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2497v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2497","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"DV6D5GVGSB23","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DV6D5GVGSB23UN2Y","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DV6D5GVG","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:a8067307638a86770062f88fe315b9753d63899da4d33f882d18671d6daaf0aa","target":"graph","created_at":"2026-05-18T03:36:37Z","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":"Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose a new encoding scheme for [n,d] error- correcting MSR codes that generalizes our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the [n,{\\alpha}] Reed-Solomon (RS) code can be integrated into the encoding matrix","authors_text":"Hong-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang S. Han","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-11T13:47:04Z","title":"Update-Efficient Regenerating Codes with Minimum Per-Node Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2497","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:250dc8495c1fcd209a51dc5ec145331c8e07b80952ca70d5bd38b524280fdaf3","target":"record","created_at":"2026-05-18T03:36:37Z","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":"5a11c56b0ab4721fa8c56e8ea7f1a2882d50b43686f1c22671f936c8bc920379","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-11T13:47:04Z","title_canon_sha256":"f0abb52e3bbd9780eacacbe19df79cfb9895f7fab281a8a95ef614d0fdad3acc"},"schema_version":"1.0","source":{"id":"1301.2497","kind":"arxiv","version":1}},"canonical_sha256":"1d7c3e9aa69075ba3758c28817cd0325b1f608644817d8dc4ceb846d6edb98bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d7c3e9aa69075ba3758c28817cd0325b1f608644817d8dc4ceb846d6edb98bc","first_computed_at":"2026-05-18T03:36:37.758198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.758198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zn80zRNnKl+0nBy0TivG0busBiNaeLPmfyiJxh6FzPHpf061646tmMV5kyEr1hGyrBYXKAnrlYevupUbQDjnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.758683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:250dc8495c1fcd209a51dc5ec145331c8e07b80952ca70d5bd38b524280fdaf3","sha256:a8067307638a86770062f88fe315b9753d63899da4d33f882d18671d6daaf0aa"],"state_sha256":"c8dc55fad88aa8f4624b8437d062fc233c3cc5600835fd7f33a46f4d0376cb5a"}