{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TESPV2IHZRSUGR6TW5AW2ENU7O","short_pith_number":"pith:TESPV2IH","schema_version":"1.0","canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","source":{"kind":"arxiv","id":"1309.3752","version":1},"attestation_state":"computed","paper":{"title":"Novel Repair-by-Transfer Codes and Systematic Exact-MBR Codes with Lower Complexities and Smaller Field Sizes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin, Wei-Ho Chung","submitted_at":"2013-09-15T11:54:39Z","abstract_excerpt":"The $(n,k,d)$ regenerating code is a class of $(n,k)$ erasure codes with the capability to recover a lost code fragment from other $d$ existing code fragments. This paper concentrates on the design of exact regenerating codes at Minimum Bandwidth Regenerating (MBR) points. For $d=n-1$, a class of $(n,k,d=n-1)$ Exact-MBR codes, termed as repair-by-transfer codes, have been developed in prior work to avoid arithmetic operations in node repairing process. The first result of this paper presents a new class of repair-by-transfer codes via congruent transformations. As compared with the prior works"},"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":"1309.3752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-09-15T11:54:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c146c8d126dae51ed0b354168909c56dc7de2f2aefc261817d909e1e2aaf2dc4","abstract_canon_sha256":"2b18fd500a4c152aec06ffbb421361d8becc49ad72c5d915f7c0c76be3e08c86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.634039Z","signature_b64":"LlaQvkcBJNTzWoI3NSvBHa59YsVs/7o8CoI7x61HczFLo8OfKpphyIHVaNKylkBonK7nFahCq74ZOf8B5xm7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","last_reissued_at":"2026-05-18T03:13:20.633243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.633243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Novel Repair-by-Transfer Codes and Systematic Exact-MBR Codes with Lower Complexities and Smaller Field Sizes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin, Wei-Ho Chung","submitted_at":"2013-09-15T11:54:39Z","abstract_excerpt":"The $(n,k,d)$ regenerating code is a class of $(n,k)$ erasure codes with the capability to recover a lost code fragment from other $d$ existing code fragments. This paper concentrates on the design of exact regenerating codes at Minimum Bandwidth Regenerating (MBR) points. For $d=n-1$, a class of $(n,k,d=n-1)$ Exact-MBR codes, termed as repair-by-transfer codes, have been developed in prior work to avoid arithmetic operations in node repairing process. The first result of this paper presents a new class of repair-by-transfer codes via congruent transformations. As compared with the prior works"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3752","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":"1309.3752","created_at":"2026-05-18T03:13:20.633377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3752v1","created_at":"2026-05-18T03:13:20.633377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3752","created_at":"2026-05-18T03:13:20.633377+00:00"},{"alias_kind":"pith_short_12","alias_value":"TESPV2IHZRSU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TESPV2IHZRSUGR6T","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TESPV2IH","created_at":"2026-05-18T12:28:02.375192+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/TESPV2IHZRSUGR6TW5AW2ENU7O","json":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O.json","graph_json":"https://pith.science/api/pith-number/TESPV2IHZRSUGR6TW5AW2ENU7O/graph.json","events_json":"https://pith.science/api/pith-number/TESPV2IHZRSUGR6TW5AW2ENU7O/events.json","paper":"https://pith.science/paper/TESPV2IH"},"agent_actions":{"view_html":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O","download_json":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O.json","view_paper":"https://pith.science/paper/TESPV2IH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3752&json=true","fetch_graph":"https://pith.science/api/pith-number/TESPV2IHZRSUGR6TW5AW2ENU7O/graph.json","fetch_events":"https://pith.science/api/pith-number/TESPV2IHZRSUGR6TW5AW2ENU7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/action/storage_attestation","attest_author":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/action/author_attestation","sign_citation":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/action/citation_signature","submit_replication":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/action/replication_record"}},"created_at":"2026-05-18T03:13:20.633377+00:00","updated_at":"2026-05-18T03:13:20.633377+00:00"}