{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4JP2CDQMZ6QUA4326LXT7HATJL","short_pith_number":"pith:4JP2CDQM","canonical_record":{"source":{"id":"1603.01213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0904bfa587d64f9e9adda612c4b162f8fe1360d806eb555ff6a9861964b6feca","abstract_canon_sha256":"981398dad0040a87d040e95b9c6572e7e0b34a83eb7ddca0affe5c0e73d569c2"},"schema_version":"1.0"},"canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","source":{"kind":"arxiv","id":"1603.01213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01213","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01213v1","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01213","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"4JP2CDQMZ6QU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JP2CDQMZ6QUA432","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JP2CDQM","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4JP2CDQMZ6QUA4326LXT7HATJL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0904bfa587d64f9e9adda612c4b162f8fe1360d806eb555ff6a9861964b6feca","abstract_canon_sha256":"981398dad0040a87d040e95b9c6572e7e0b34a83eb7ddca0affe5c0e73d569c2"},"schema_version":"1.0"},"canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.386248Z","signature_b64":"Uj6PnfDDx42uu3VD6Y6z2Qx087GkV1UyHU3ntPPo6vzc0JysFl07ttBnmnxrNpMt523pg2ZAb/7acakBsfhXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","last_reissued_at":"2026-05-18T01:19:39.385602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.385602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01213","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-18T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QSE+woyct0M12jSlv2Hc25vTUKRekzFrZVPPkSGP+XPUDSXX/M0eRYo+hSIjUCNDOp0+B7ZPwF/2C6AQqmsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:28:13.623171Z"},"content_sha256":"34304980952ee14e1d508f8ee784d9e8fb4a727158ed67431fd230f661013bd1","schema_version":"1.0","event_id":"sha256:34304980952ee14e1d508f8ee784d9e8fb4a727158ed67431fd230f661013bd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4JP2CDQMZ6QUA4326LXT7HATJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Rebuilding of Multiple Erasures in MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","submitted_at":"2016-03-03T18:42:44Z","abstract_excerpt":"MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information in the surviving nodes. However, in practice, $e$ erasures is a more likely failure event, for $1\\le e<r$. Hence, a natural question is how much information do we need to access in order to rebuild $e$ storage nodes? We define the rebuilding ratio as the fraction of remaining information accessed during the rebuilding of $e$ erasures. In our previous work we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01213","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-18T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgRURDNf9+5h79HVB/o2yYQBk9jNlmpYdU/1cTB6Y0Wucq7hBmcEKR8y0inIBDWoLswUko1Z+RKd+7yaOTVpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:28:13.623535Z"},"content_sha256":"f8dcfe8755d27683de12aade0402b8a8968063ec25181f61c55170cef61fe81f","schema_version":"1.0","event_id":"sha256:f8dcfe8755d27683de12aade0402b8a8968063ec25181f61c55170cef61fe81f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/bundle.json","state_url":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JP2CDQMZ6QUA4326LXT7HATJL/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-22T14:28:13Z","links":{"resolver":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL","bundle":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/bundle.json","state":"https://pith.science/pith/4JP2CDQMZ6QUA4326LXT7HATJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JP2CDQMZ6QUA4326LXT7HATJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4JP2CDQMZ6QUA4326LXT7HATJL","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":"981398dad0040a87d040e95b9c6572e7e0b34a83eb7ddca0affe5c0e73d569c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","title_canon_sha256":"0904bfa587d64f9e9adda612c4b162f8fe1360d806eb555ff6a9861964b6feca"},"schema_version":"1.0","source":{"id":"1603.01213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01213","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01213v1","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01213","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"4JP2CDQMZ6QU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JP2CDQMZ6QUA432","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JP2CDQM","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:f8dcfe8755d27683de12aade0402b8a8968063ec25181f61c55170cef61fe81f","target":"graph","created_at":"2026-05-18T01:19:39Z","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":"MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information in the surviving nodes. However, in practice, $e$ erasures is a more likely failure event, for $1\\le e<r$. Hence, a natural question is how much information do we need to access in order to rebuild $e$ storage nodes? We define the rebuilding ratio as the fraction of remaining information accessed during the rebuilding of $e$ erasures. In our previous work we ","authors_text":"Itzhak Tamo, Jehoshua Bruck, Zhiying Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","title":"Optimal Rebuilding of Multiple Erasures in MDS Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01213","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:34304980952ee14e1d508f8ee784d9e8fb4a727158ed67431fd230f661013bd1","target":"record","created_at":"2026-05-18T01:19:39Z","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":"981398dad0040a87d040e95b9c6572e7e0b34a83eb7ddca0affe5c0e73d569c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-03T18:42:44Z","title_canon_sha256":"0904bfa587d64f9e9adda612c4b162f8fe1360d806eb555ff6a9861964b6feca"},"schema_version":"1.0","source":{"id":"1603.01213","kind":"arxiv","version":1}},"canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25fa10e0ccfa140737af2ef3f9c134ada31182b834ebf4fdfbe383328c13136","first_computed_at":"2026-05-18T01:19:39.385602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:39.385602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uj6PnfDDx42uu3VD6Y6z2Qx087GkV1UyHU3ntPPo6vzc0JysFl07ttBnmnxrNpMt523pg2ZAb/7acakBsfhXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:39.386248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34304980952ee14e1d508f8ee784d9e8fb4a727158ed67431fd230f661013bd1","sha256:f8dcfe8755d27683de12aade0402b8a8968063ec25181f61c55170cef61fe81f"],"state_sha256":"15a3b8347fe49611194a1d5df638e6b8e4a69ad639ebc3588180d238b2b857f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmXaeFBrs96vEFH/SLlbUVFI5zE3um2HGz2FysXeG5yD5yNsdyH0d8UDa3kGeifnzPSQ1Ve0Y6URgt2QHqolDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:28:13.625641Z","bundle_sha256":"02c61b62472732f57a2cfa54a075f534eb480df472bfa6bdcd30afbbfa72929b"}}