{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EMRQ7NIBYIGZQDQST2BZF5MMZS","short_pith_number":"pith:EMRQ7NIB","canonical_record":{"source":{"id":"1302.4129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-17T22:43:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1907166b57ae972c467b5012453622f33454e1c729cc0dfeeb35f73bdcc795c","abstract_canon_sha256":"0314fbd3ced22804b2e49369067001da51c69abbb356870faed5694d23ca3d42"},"schema_version":"1.0"},"canonical_sha256":"23230fb501c20d980e129e8392f58ccca2eed371df9bc02cdacb290cc61c01c6","source":{"kind":"arxiv","id":"1302.4129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4129","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4129v1","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4129","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"EMRQ7NIBYIGZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EMRQ7NIBYIGZQDQS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EMRQ7NIB","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EMRQ7NIBYIGZQDQST2BZF5MMZS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-17T22:43:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1907166b57ae972c467b5012453622f33454e1c729cc0dfeeb35f73bdcc795c","abstract_canon_sha256":"0314fbd3ced22804b2e49369067001da51c69abbb356870faed5694d23ca3d42"},"schema_version":"1.0"},"canonical_sha256":"23230fb501c20d980e129e8392f58ccca2eed371df9bc02cdacb290cc61c01c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:24.055953Z","signature_b64":"rQ285gVMBnz0nfYmR1/ud4GqnSn6chqVwleG2kiDcv1fehivQFqisEnrZHDJIq/ORNfMOnSrFLsRelE4x1fCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23230fb501c20d980e129e8392f58ccca2eed371df9bc02cdacb290cc61c01c6","last_reissued_at":"2026-05-18T03:33:24.055430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:24.055430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4129","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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBgYLp7zVgKGY2eHRM/GXrDyEJtIfZraOpI+XTYuQ0wkTWSMQSbRNQjrvJd3Ic0cZMB4kMwalentjjtWg6Q2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:22:24.461035Z"},"content_sha256":"b5dafb7eb29310a52039ad7724cba062ab40e34ba2b8db5a2b9b6567c47c6776","schema_version":"1.0","event_id":"sha256:b5dafb7eb29310a52039ad7724cba062ab40e34ba2b8db5a2b9b6567c47c6776"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EMRQ7NIBYIGZQDQST2BZF5MMZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repair-Optimal MDS Array Codes over GF(2)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cyril Guyot, Eyal En Gad, Filip Blagojevic, Robert Mateescu, Zvonimir Bandic","submitted_at":"2013-02-17T22:43:20Z","abstract_excerpt":"Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required for the recovery of failed nodes. However, the encoding and decoding algorithms of the proposed codes use arithmetic over finite fields of order greater than 2, which could result in a complex implementation.\n  In this work, we present a construction of 2-parity MDS array codes, that allow for optimal repair of a failed information node using XOR operations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4129","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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvvB8YJPlKdZ+/5fCT6uO00qi06rZkimUafsCAg99Wj6h+sOAHVfU4zY48cxub+r4liIppXp3dn3cjxdnwSyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:22:24.461407Z"},"content_sha256":"8793c196a5c6c2db18baea8ab130bb8cd06d5dfc935e40c709c578a6db10ab0e","schema_version":"1.0","event_id":"sha256:8793c196a5c6c2db18baea8ab130bb8cd06d5dfc935e40c709c578a6db10ab0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/bundle.json","state_url":"https://pith.science/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/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-05-30T09:22:24Z","links":{"resolver":"https://pith.science/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS","bundle":"https://pith.science/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/bundle.json","state":"https://pith.science/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMRQ7NIBYIGZQDQST2BZF5MMZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EMRQ7NIBYIGZQDQST2BZF5MMZS","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":"0314fbd3ced22804b2e49369067001da51c69abbb356870faed5694d23ca3d42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-17T22:43:20Z","title_canon_sha256":"e1907166b57ae972c467b5012453622f33454e1c729cc0dfeeb35f73bdcc795c"},"schema_version":"1.0","source":{"id":"1302.4129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4129","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4129v1","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4129","created_at":"2026-05-18T03:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"EMRQ7NIBYIGZ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EMRQ7NIBYIGZQDQS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EMRQ7NIB","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8793c196a5c6c2db18baea8ab130bb8cd06d5dfc935e40c709c578a6db10ab0e","target":"graph","created_at":"2026-05-18T03:33:24Z","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":"Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required for the recovery of failed nodes. However, the encoding and decoding algorithms of the proposed codes use arithmetic over finite fields of order greater than 2, which could result in a complex implementation.\n  In this work, we present a construction of 2-parity MDS array codes, that allow for optimal repair of a failed information node using XOR operations","authors_text":"Cyril Guyot, Eyal En Gad, Filip Blagojevic, Robert Mateescu, Zvonimir Bandic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-17T22:43:20Z","title":"Repair-Optimal MDS Array Codes over GF(2)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4129","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:b5dafb7eb29310a52039ad7724cba062ab40e34ba2b8db5a2b9b6567c47c6776","target":"record","created_at":"2026-05-18T03:33:24Z","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":"0314fbd3ced22804b2e49369067001da51c69abbb356870faed5694d23ca3d42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-17T22:43:20Z","title_canon_sha256":"e1907166b57ae972c467b5012453622f33454e1c729cc0dfeeb35f73bdcc795c"},"schema_version":"1.0","source":{"id":"1302.4129","kind":"arxiv","version":1}},"canonical_sha256":"23230fb501c20d980e129e8392f58ccca2eed371df9bc02cdacb290cc61c01c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23230fb501c20d980e129e8392f58ccca2eed371df9bc02cdacb290cc61c01c6","first_computed_at":"2026-05-18T03:33:24.055430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:24.055430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQ285gVMBnz0nfYmR1/ud4GqnSn6chqVwleG2kiDcv1fehivQFqisEnrZHDJIq/ORNfMOnSrFLsRelE4x1fCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:24.055953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5dafb7eb29310a52039ad7724cba062ab40e34ba2b8db5a2b9b6567c47c6776","sha256:8793c196a5c6c2db18baea8ab130bb8cd06d5dfc935e40c709c578a6db10ab0e"],"state_sha256":"5874a7c05b6fcbc5a935a2b03a73acdba864e56b92a537dbf221dffcfc8fc1de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzXFdP9Cgxq/ap/rDmVElmJsTdm2otwIaT6qnzrbzBeN+FsofItXL1ZgjxCkLO6Y1qWp5oAafSSuX3TkvlHDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:22:24.463410Z","bundle_sha256":"25c1e46e96c32ad919d1e5d3690056a77a612692acdef90ee81a0d2d12e8aa45"}}