{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B72AU6AA6ICKL2AOKDNIWX3FSG","short_pith_number":"pith:B72AU6AA","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"},"canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","source":{"kind":"arxiv","id":"1301.4620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4620","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4620v2","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4620","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"B72AU6AA6ICK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B72AU6AA6ICKL2AO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B72AU6AA","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B72AU6AA6ICKL2AOKDNIWX3FSG","target":"record","payload":{"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"},"canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","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"},"source_kind":"arxiv","source_id":"1301.4620","source_version":2,"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0wWRKbVtnVFv3729RmvKIe7AOvksNztvS88/80s/hzdN1VJz4285P0vKH7VgW29oehrVr1X4XZnNJRfwV9rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:38:34.170561Z"},"content_sha256":"167653b17a4b7c5425191c228efa7682ebce3c0ac19df5ffe235acb7680070f4","schema_version":"1.0","event_id":"sha256:167653b17a4b7c5425191c228efa7682ebce3c0ac19df5ffe235acb7680070f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B72AU6AA6ICKL2AOKDNIWX3FSG","target":"graph","payload":{"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"},"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-18T02:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0orddAHBUKPm3FRSQVEgrSLeCIV144WdaTopqQv5FTeXpAQm2fTUtw76zcAEex27NPAvW3JB15IfDGyC0B04Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:38:34.170903Z"},"content_sha256":"197bc2f39fe38120f69b0f33d7fb70c67f71a2c81b8a53ec08c3cdbff65b5348","schema_version":"1.0","event_id":"sha256:197bc2f39fe38120f69b0f33d7fb70c67f71a2c81b8a53ec08c3cdbff65b5348"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/bundle.json","state_url":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/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-03T03:38:34Z","links":{"resolver":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG","bundle":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/bundle.json","state":"https://pith.science/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B72AU6AA6ICKL2AOKDNIWX3FSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B72AU6AA6ICKL2AOKDNIWX3FSG","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":"d7bc055a108e1b572c9ff46437ff32362b77fd3c4ab8f58b46b2bedf4c260ffc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-20T02:03:41Z","title_canon_sha256":"3b90e96be2a80d98a50ad4224bf1e26c5f3683de5e8e8d5714d783b60304926e"},"schema_version":"1.0","source":{"id":"1301.4620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4620","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4620v2","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4620","created_at":"2026-05-18T02:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"B72AU6AA6ICK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B72AU6AA6ICKL2AO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B72AU6AA","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:197bc2f39fe38120f69b0f33d7fb70c67f71a2c81b8a53ec08c3cdbff65b5348","target":"graph","created_at":"2026-05-18T02:49:03Z","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 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","authors_text":"Hung-Ta Pai, Pramod K. Varshney, Rong Zheng, Yunghsiang Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-20T02:03:41Z","title":"Update-Efficient Error-Correcting Product-Matrix Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4620","kind":"arxiv","version":2},"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:167653b17a4b7c5425191c228efa7682ebce3c0ac19df5ffe235acb7680070f4","target":"record","created_at":"2026-05-18T02:49:03Z","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":"d7bc055a108e1b572c9ff46437ff32362b77fd3c4ab8f58b46b2bedf4c260ffc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-20T02:03:41Z","title_canon_sha256":"3b90e96be2a80d98a50ad4224bf1e26c5f3683de5e8e8d5714d783b60304926e"},"schema_version":"1.0","source":{"id":"1301.4620","kind":"arxiv","version":2}},"canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ff40a7800f204a5e80e50da8b5f6591a49377a9012ae6d5884dc082a576c2ab","first_computed_at":"2026-05-18T02:49:03.394168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:03.394168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wKPXuASA1HTnpjr+yPu/CiHNZwnph/WyQ33cHuJW7aOC8gcDeOx3NVtlQYg0TQf7wAOmukFvOkLFcYy4WKeXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:03.394648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:167653b17a4b7c5425191c228efa7682ebce3c0ac19df5ffe235acb7680070f4","sha256:197bc2f39fe38120f69b0f33d7fb70c67f71a2c81b8a53ec08c3cdbff65b5348"],"state_sha256":"85126a8f6a60f3549a4785275d63fa307806bb25bbb6c915c090cea2c149fa9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oLZf5ofdSYOdgHdqpbYD6XLbyjqq+1wUhGtUlDDHpsIgBKKWCzwzYgGDK12bAjPkigT3AFGTorKr47ASL91Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:38:34.172842Z","bundle_sha256":"b3cff03704c6d14e88a851aed7a15e91fdc6a33e5e9dc023f4d3f6597cb8ca77"}}