{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B72AU6AA6ICKL2AOKDNIWX3FSG","short_pith_number":"pith:B72AU6AA","schema_version":"1.0","canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","source":{"kind":"arxiv","id":"1301.4620","version":2},"attestation_state":"computed","paper":{"title":"Update-Efficient Error-Correcting Product-Matrix Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang Han","submitted_at":"2013-01-20T02:03:41Z","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 new encoding schemes for $[n,d]$ error-correcting MSR and MBR codes that generalize 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"},"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.4620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-20T02:03:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b90e96be2a80d98a50ad4224bf1e26c5f3683de5e8e8d5714d783b60304926e","abstract_canon_sha256":"d7bc055a108e1b572c9ff46437ff32362b77fd3c4ab8f58b46b2bedf4c260ffc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.394648Z","signature_b64":"wKPXuASA1HTnpjr+yPu/CiHNZwnph/WyQ33cHuJW7aOC8gcDeOx3NVtlQYg0TQf7wAOmukFvOkLFcYy4WKeXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","last_reissued_at":"2026-05-18T02:49:03.394168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.394168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Update-Efficient Error-Correcting Product-Matrix Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang Han","submitted_at":"2013-01-20T02:03:41Z","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 new encoding schemes for $[n,d]$ error-correcting MSR and MBR codes that generalize 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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4620","kind":"arxiv","version":2},"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.4620","created_at":"2026-05-18T02:49:03.394235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4620v2","created_at":"2026-05-18T02:49:03.394235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4620","created_at":"2026-05-18T02:49:03.394235+00:00"},{"alias_kind":"pith_short_12","alias_value":"B72AU6AA6ICK","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B72AU6AA6ICKL2AO","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B72AU6AA","created_at":"2026-05-18T12:27:38.830355+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/B72AU6AA6ICKL2AOKDNIWX3FSG","json":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG.json","graph_json":"https://pith.science/api/pith-number/B72AU6AA6ICKL2AOKDNIWX3FSG/graph.json","events_json":"https://pith.science/api/pith-number/B72AU6AA6ICKL2AOKDNIWX3FSG/events.json","paper":"https://pith.science/paper/B72AU6AA"},"agent_actions":{"view_html":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG","download_json":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG.json","view_paper":"https://pith.science/paper/B72AU6AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4620&json=true","fetch_graph":"https://pith.science/api/pith-number/B72AU6AA6ICKL2AOKDNIWX3FSG/graph.json","fetch_events":"https://pith.science/api/pith-number/B72AU6AA6ICKL2AOKDNIWX3FSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/action/storage_attestation","attest_author":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/action/author_attestation","sign_citation":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/action/citation_signature","submit_replication":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/action/replication_record"}},"created_at":"2026-05-18T02:49:03.394235+00:00","updated_at":"2026-05-18T02:49:03.394235+00:00"}