{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:USA4Z2DCUNI446WL4MW2X57JVY","short_pith_number":"pith:USA4Z2DC","canonical_record":{"source":{"id":"1802.07891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-22T03:31:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9ade525684b2dbec0c876878d8725ff2057c80f995874b7b064c71fa56f4e55","abstract_canon_sha256":"312ccffe14a34f82380f864fef97078e8893ea8ca71b78327a061a3020c48e39"},"schema_version":"1.0"},"canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","source":{"kind":"arxiv","id":"1802.07891","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07891","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07891v3","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07891","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"USA4Z2DCUNI4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USA4Z2DCUNI446WL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USA4Z2DC","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:USA4Z2DCUNI446WL4MW2X57JVY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-22T03:31:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9ade525684b2dbec0c876878d8725ff2057c80f995874b7b064c71fa56f4e55","abstract_canon_sha256":"312ccffe14a34f82380f864fef97078e8893ea8ca71b78327a061a3020c48e39"},"schema_version":"1.0"},"canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.039835Z","signature_b64":"O29WU4n7O2Eojdkh2prmeu/FSj1nXMfn3gJSY+rsqVPbLDiLFRlgImMrzh7W3bXw4+NC45rqavxsJ3/J1Jg7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","last_reissued_at":"2026-05-17T23:42:49.039406Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.039406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07891","source_version":3,"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6SH1F5+QPrRe6Sz/2s4visZKk620HfFTE2hFIEb33OrZXKdhOfgVrO1BWZMfL2MPFajMYmLx2g9gxzTQZsPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:43.315719Z"},"content_sha256":"062c361694526467d384d6a8e68fad9046e30850fed7d84460fca3e2d0a1080a","schema_version":"1.0","event_id":"sha256:062c361694526467d384d6a8e68fad9046e30850fed7d84460fca3e2d0a1080a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:USA4Z2DCUNI446WL4MW2X57JVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Hui Li, Patrick P. C. Lee, Yuchong Hu, Yunghsiang Han","submitted_at":"2018-02-22T03:31:11Z","abstract_excerpt":"Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are constructed by encoding $k$ information columns into $r$ parity columns, in which each element in a column is a bit, such that any $k$ out of the $k+r$ columns suffice to recover all information bits. In addition to providing fault tolerance, it is critical to improve repair performance in practical applications. Specifically, if a single column fails, our go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07891","kind":"arxiv","version":3},"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPxbsxaxEVwJEAiku0spAjwwv9zEmn60ugR3/YmBs/ziwS2+XQywnVpY+YlLMFAThi4x11c78r6oTiz1vWWaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:43.316414Z"},"content_sha256":"aaee23cbb4abae725e568cd6c23342f4f7dc25aa0c460694ecad911e26adcbe2","schema_version":"1.0","event_id":"sha256:aaee23cbb4abae725e568cd6c23342f4f7dc25aa0c460694ecad911e26adcbe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/bundle.json","state_url":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USA4Z2DCUNI446WL4MW2X57JVY/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-26T21:59:43Z","links":{"resolver":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY","bundle":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/bundle.json","state":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USA4Z2DCUNI446WL4MW2X57JVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:USA4Z2DCUNI446WL4MW2X57JVY","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":"312ccffe14a34f82380f864fef97078e8893ea8ca71b78327a061a3020c48e39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-22T03:31:11Z","title_canon_sha256":"f9ade525684b2dbec0c876878d8725ff2057c80f995874b7b064c71fa56f4e55"},"schema_version":"1.0","source":{"id":"1802.07891","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07891","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07891v3","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07891","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"USA4Z2DCUNI4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USA4Z2DCUNI446WL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USA4Z2DC","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:aaee23cbb4abae725e568cd6c23342f4f7dc25aa0c460694ecad911e26adcbe2","target":"graph","created_at":"2026-05-17T23:42:49Z","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":"Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are constructed by encoding $k$ information columns into $r$ parity columns, in which each element in a column is a bit, such that any $k$ out of the $k+r$ columns suffice to recover all information bits. In addition to providing fault tolerance, it is critical to improve repair performance in practical applications. Specifically, if a single column fails, our go","authors_text":"Hanxu Hou, Hui Li, Patrick P. C. Lee, Yuchong Hu, Yunghsiang Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-22T03:31:11Z","title":"A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07891","kind":"arxiv","version":3},"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:062c361694526467d384d6a8e68fad9046e30850fed7d84460fca3e2d0a1080a","target":"record","created_at":"2026-05-17T23:42:49Z","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":"312ccffe14a34f82380f864fef97078e8893ea8ca71b78327a061a3020c48e39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-22T03:31:11Z","title_canon_sha256":"f9ade525684b2dbec0c876878d8725ff2057c80f995874b7b064c71fa56f4e55"},"schema_version":"1.0","source":{"id":"1802.07891","kind":"arxiv","version":3}},"canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","first_computed_at":"2026-05-17T23:42:49.039406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.039406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O29WU4n7O2Eojdkh2prmeu/FSj1nXMfn3gJSY+rsqVPbLDiLFRlgImMrzh7W3bXw4+NC45rqavxsJ3/J1Jg7BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.039835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07891","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:062c361694526467d384d6a8e68fad9046e30850fed7d84460fca3e2d0a1080a","sha256:aaee23cbb4abae725e568cd6c23342f4f7dc25aa0c460694ecad911e26adcbe2"],"state_sha256":"e263492f59c1c5a6cebb538521f28fdec3c1c2a0f337cc6357be5ac075a3cbef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zA/hRc4Lmej5Ug8DfC2YDejVzbX5a6KApJgajtR2MuA2EzQd+PgygEzUfd1bHb1zT04c1vEEa5m3jKc4Q/vvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:59:43.320256Z","bundle_sha256":"01b224042e615a806d27228ef249e478bdf1f345dcd97ed68579a6f326a1f6c3"}}