{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TESPV2IHZRSUGR6TW5AW2ENU7O","short_pith_number":"pith:TESPV2IH","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"},"canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","source":{"kind":"arxiv","id":"1309.3752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3752","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3752v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3752","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"TESPV2IHZRSU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TESPV2IHZRSUGR6T","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TESPV2IH","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TESPV2IHZRSUGR6TW5AW2ENU7O","target":"record","payload":{"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"},"canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","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"},"source_kind":"arxiv","source_id":"1309.3752","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqdDGvQbtm5cIX2g3d/4PCyRgscq0rFKIE0Q787Le3z4v+iil/WFhaBj5dgbc/DZjz/L6NWIV23X409A3GPLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:35:24.086508Z"},"content_sha256":"114b2ad0d7bb78f911a1e67572614aea448fe7bb085c75640a00cee0deca7986","schema_version":"1.0","event_id":"sha256:114b2ad0d7bb78f911a1e67572614aea448fe7bb085c75640a00cee0deca7986"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TESPV2IHZRSUGR6TW5AW2ENU7O","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwpmUOSQNkTac+Iob1Wg9yP7YsAgSgIHY+YKTOPABJPrLtFDO3UMu1L18yw4wIfLSV+UQxImH1mZbFLcccUNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:35:24.086859Z"},"content_sha256":"44469afafc419d6cc0a4d60ede9f014b30b4c547e8cf0fa75b11ef5c39277163","schema_version":"1.0","event_id":"sha256:44469afafc419d6cc0a4d60ede9f014b30b4c547e8cf0fa75b11ef5c39277163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/bundle.json","state_url":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T09:35:24Z","links":{"resolver":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O","bundle":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/bundle.json","state":"https://pith.science/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TESPV2IHZRSUGR6TW5AW2ENU7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TESPV2IHZRSUGR6TW5AW2ENU7O","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":"2b18fd500a4c152aec06ffbb421361d8becc49ad72c5d915f7c0c76be3e08c86","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-09-15T11:54:39Z","title_canon_sha256":"c146c8d126dae51ed0b354168909c56dc7de2f2aefc261817d909e1e2aaf2dc4"},"schema_version":"1.0","source":{"id":"1309.3752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3752","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3752v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3752","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"TESPV2IHZRSU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TESPV2IHZRSUGR6T","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TESPV2IH","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:44469afafc419d6cc0a4d60ede9f014b30b4c547e8cf0fa75b11ef5c39277163","target":"graph","created_at":"2026-05-18T03:13:20Z","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":"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","authors_text":"Sian-Jheng Lin, Wei-Ho Chung","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-09-15T11:54:39Z","title":"Novel Repair-by-Transfer Codes and Systematic Exact-MBR Codes with Lower Complexities and Smaller Field Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3752","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:114b2ad0d7bb78f911a1e67572614aea448fe7bb085c75640a00cee0deca7986","target":"record","created_at":"2026-05-18T03:13:20Z","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":"2b18fd500a4c152aec06ffbb421361d8becc49ad72c5d915f7c0c76be3e08c86","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-09-15T11:54:39Z","title_canon_sha256":"c146c8d126dae51ed0b354168909c56dc7de2f2aefc261817d909e1e2aaf2dc4"},"schema_version":"1.0","source":{"id":"1309.3752","kind":"arxiv","version":1}},"canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9924fae907cc654347d3b7416d11b4fbaabea9f7717650b90d2dd9574868bbe2","first_computed_at":"2026-05-18T03:13:20.633243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.633243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LlaQvkcBJNTzWoI3NSvBHa59YsVs/7o8CoI7x61HczFLo8OfKpphyIHVaNKylkBonK7nFahCq74ZOf8B5xm7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.634039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:114b2ad0d7bb78f911a1e67572614aea448fe7bb085c75640a00cee0deca7986","sha256:44469afafc419d6cc0a4d60ede9f014b30b4c547e8cf0fa75b11ef5c39277163"],"state_sha256":"4a421bbe27844aecd975d2ebdf59c94b27e8eb59155b76439f2559dbb0356703"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eafjAfvYg9DWolALZv3kJcDjUVbi9q3xh/LF/ynaF7KxmSf60VA79s9IxcANFcgzV4+t+dO83foERTtcd8icBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:35:24.088802Z","bundle_sha256":"5c01f252cbe40eeee749ad77d34aeda9d8c6211f82c4283a15bf6fb5462a6540"}}