{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CUCJYPW5TUNUQOPXKEGIQGLS3C","short_pith_number":"pith:CUCJYPW5","canonical_record":{"source":{"id":"1009.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T21:54:20Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"24b6b4d78524be83d4f5e69fe54d8e3654074c208a829d10c3c447fdaf3af6c5","abstract_canon_sha256":"13af5ac9fa3e7456e16410bd8800d82c68827470158285e2d23eab663d509daa"},"schema_version":"1.0"},"canonical_sha256":"15049c3edd9d1b4839f7510c881972d88a584022d3da40134df222dc1c660b17","source":{"kind":"arxiv","id":"1009.3291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3291","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3291v1","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3291","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"CUCJYPW5TUNU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CUCJYPW5TUNUQOPX","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CUCJYPW5","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CUCJYPW5TUNUQOPXKEGIQGLS3C","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T21:54:20Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"24b6b4d78524be83d4f5e69fe54d8e3654074c208a829d10c3c447fdaf3af6c5","abstract_canon_sha256":"13af5ac9fa3e7456e16410bd8800d82c68827470158285e2d23eab663d509daa"},"schema_version":"1.0"},"canonical_sha256":"15049c3edd9d1b4839f7510c881972d88a584022d3da40134df222dc1c660b17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:46.042989Z","signature_b64":"RJPXx6TFwk9m393hq3PZ29fBJZor5zarYZew2SUmi+OxpJNrHb5HaOIo6qC87vczxT5s3YrzRlQuNRZ/DOL6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15049c3edd9d1b4839f7510c881972d88a584022d3da40134df222dc1c660b17","last_reissued_at":"2026-05-18T04:40:46.042419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:46.042419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3291","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-18T04:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AwDfD7vhlupPQZkx9o7O4wxFrvofFUC0WNJsKRQMz1PIAGcreatVZXDt6YXzQEXtiqbI58ie1rm6ytYELNuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:43:39.224302Z"},"content_sha256":"bb9865ece1b8dea20cf33dacc92a3836e16b6885c0d0b17bf5781592e67560f3","schema_version":"1.0","event_id":"sha256:bb9865ece1b8dea20cf33dacc92a3836e16b6885c0d0b17bf5781592e67560f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CUCJYPW5TUNUQOPXKEGIQGLS3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rebuilding for Array Codes in Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Jehoshua Bruck, Zhiying Wang","submitted_at":"2010-09-16T21:54:20Z","abstract_excerpt":"In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are maximum distance separable (MDS) array codes that are used to protect against erasures, and only require XOR operations for encoding and decoding. We show that when there are two redundancy nodes, to rebuild one erased systematic node, only 3/4 of the information needs to be transmitted. Interestingly, in many cases, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3291","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-18T04:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtTkR1TRVj5opyADbVvQou9LiKv4vyRn1M0LvsnABftheffiT6ymNrJtbYOxdmApn9N/vO/ZjNQLlIX+CayMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:43:39.224670Z"},"content_sha256":"bb13e5db4de42fff82697f5db853e8e53a85f772f7b9430404b952fe038ea3d0","schema_version":"1.0","event_id":"sha256:bb13e5db4de42fff82697f5db853e8e53a85f772f7b9430404b952fe038ea3d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/bundle.json","state_url":"https://pith.science/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/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-05T10:43:39Z","links":{"resolver":"https://pith.science/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C","bundle":"https://pith.science/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/bundle.json","state":"https://pith.science/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUCJYPW5TUNUQOPXKEGIQGLS3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CUCJYPW5TUNUQOPXKEGIQGLS3C","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":"13af5ac9fa3e7456e16410bd8800d82c68827470158285e2d23eab663d509daa","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T21:54:20Z","title_canon_sha256":"24b6b4d78524be83d4f5e69fe54d8e3654074c208a829d10c3c447fdaf3af6c5"},"schema_version":"1.0","source":{"id":"1009.3291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3291","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3291v1","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3291","created_at":"2026-05-18T04:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"CUCJYPW5TUNU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CUCJYPW5TUNUQOPX","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CUCJYPW5","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:bb13e5db4de42fff82697f5db853e8e53a85f772f7b9430404b952fe038ea3d0","target":"graph","created_at":"2026-05-18T04:40:46Z","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":"In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are maximum distance separable (MDS) array codes that are used to protect against erasures, and only require XOR operations for encoding and decoding. We show that when there are two redundancy nodes, to rebuild one erased systematic node, only 3/4 of the information needs to be transmitted. Interestingly, in many cases, the","authors_text":"Alexandros G. Dimakis, Jehoshua Bruck, Zhiying Wang","cross_cats":["cs.DC","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T21:54:20Z","title":"Rebuilding for Array Codes in Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3291","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:bb9865ece1b8dea20cf33dacc92a3836e16b6885c0d0b17bf5781592e67560f3","target":"record","created_at":"2026-05-18T04:40:46Z","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":"13af5ac9fa3e7456e16410bd8800d82c68827470158285e2d23eab663d509daa","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T21:54:20Z","title_canon_sha256":"24b6b4d78524be83d4f5e69fe54d8e3654074c208a829d10c3c447fdaf3af6c5"},"schema_version":"1.0","source":{"id":"1009.3291","kind":"arxiv","version":1}},"canonical_sha256":"15049c3edd9d1b4839f7510c881972d88a584022d3da40134df222dc1c660b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15049c3edd9d1b4839f7510c881972d88a584022d3da40134df222dc1c660b17","first_computed_at":"2026-05-18T04:40:46.042419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:46.042419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJPXx6TFwk9m393hq3PZ29fBJZor5zarYZew2SUmi+OxpJNrHb5HaOIo6qC87vczxT5s3YrzRlQuNRZ/DOL6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:46.042989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb9865ece1b8dea20cf33dacc92a3836e16b6885c0d0b17bf5781592e67560f3","sha256:bb13e5db4de42fff82697f5db853e8e53a85f772f7b9430404b952fe038ea3d0"],"state_sha256":"a2f6c4a332ec40c9489ba9efb903929332e70067c583529ca8861b4e69035a06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Doq07Noyg5AzSOLM+EccqjbBRIUS7XnbaoBBgRD1flo9zmU80fcWF5OoSsofJ7hCqX5woHmOHnUlFcYyQp2qBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:43:39.226704Z","bundle_sha256":"4f1e6e11828470034fdb1689c5209b5c51c0b5aa1cbeab6b06d9c725873d28ea"}}