{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DV6D5GVGSB23UN2YYKEBPTIDEW","short_pith_number":"pith:DV6D5GVG","schema_version":"1.0","canonical_sha256":"1d7c3e9aa69075ba3758c28817cd0325b1f608644817d8dc4ceb846d6edb98bc","source":{"kind":"arxiv","id":"1301.2497","version":1},"attestation_state":"computed","paper":{"title":"Update-Efficient Regenerating Codes with Minimum Per-Node Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hong-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang S. Han","submitted_at":"2013-01-11T13:47:04Z","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"},"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":"1301.2497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-11T13:47:04Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"f0abb52e3bbd9780eacacbe19df79cfb9895f7fab281a8a95ef614d0fdad3acc","abstract_canon_sha256":"5a11c56b0ab4721fa8c56e8ea7f1a2882d50b43686f1c22671f936c8bc920379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.758683Z","signature_b64":"Zn80zRNnKl+0nBy0TivG0busBiNaeLPmfyiJxh6FzPHpf061646tmMV5kyEr1hGyrBYXKAnrlYevupUbQDjnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7c3e9aa69075ba3758c28817cd0325b1f608644817d8dc4ceb846d6edb98bc","last_reissued_at":"2026-05-18T03:36:37.758198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.758198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Update-Efficient Regenerating Codes with Minimum Per-Node Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hong-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang S. Han","submitted_at":"2013-01-11T13:47:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2497","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":"1301.2497","created_at":"2026-05-18T03:36:37.758275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2497v1","created_at":"2026-05-18T03:36:37.758275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2497","created_at":"2026-05-18T03:36:37.758275+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV6D5GVGSB23","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV6D5GVGSB23UN2Y","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV6D5GVG","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19248","citing_title":"Quantum Entanglement Halves the Oblivious Update Bandwidth","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW","json":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW.json","graph_json":"https://pith.science/api/pith-number/DV6D5GVGSB23UN2YYKEBPTIDEW/graph.json","events_json":"https://pith.science/api/pith-number/DV6D5GVGSB23UN2YYKEBPTIDEW/events.json","paper":"https://pith.science/paper/DV6D5GVG"},"agent_actions":{"view_html":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW","download_json":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW.json","view_paper":"https://pith.science/paper/DV6D5GVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2497&json=true","fetch_graph":"https://pith.science/api/pith-number/DV6D5GVGSB23UN2YYKEBPTIDEW/graph.json","fetch_events":"https://pith.science/api/pith-number/DV6D5GVGSB23UN2YYKEBPTIDEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW/action/storage_attestation","attest_author":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW/action/author_attestation","sign_citation":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW/action/citation_signature","submit_replication":"https://pith.science/pith/DV6D5GVGSB23UN2YYKEBPTIDEW/action/replication_record"}},"created_at":"2026-05-18T03:36:37.758275+00:00","updated_at":"2026-05-18T03:36:37.758275+00:00"}