{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:USA4Z2DCUNI446WL4MW2X57JVY","short_pith_number":"pith:USA4Z2DC","schema_version":"1.0","canonical_sha256":"a481cce862a351ce7acbe32dabf7e9ae31c1334f74b2e91c913920e5987030aa","source":{"kind":"arxiv","id":"1802.07891","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.07891","created_at":"2026-05-17T23:42:49.039468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07891v3","created_at":"2026-05-17T23:42:49.039468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07891","created_at":"2026-05-17T23:42:49.039468+00:00"},{"alias_kind":"pith_short_12","alias_value":"USA4Z2DCUNI4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"USA4Z2DCUNI446WL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"USA4Z2DC","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY","json":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY.json","graph_json":"https://pith.science/api/pith-number/USA4Z2DCUNI446WL4MW2X57JVY/graph.json","events_json":"https://pith.science/api/pith-number/USA4Z2DCUNI446WL4MW2X57JVY/events.json","paper":"https://pith.science/paper/USA4Z2DC"},"agent_actions":{"view_html":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY","download_json":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY.json","view_paper":"https://pith.science/paper/USA4Z2DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07891&json=true","fetch_graph":"https://pith.science/api/pith-number/USA4Z2DCUNI446WL4MW2X57JVY/graph.json","fetch_events":"https://pith.science/api/pith-number/USA4Z2DCUNI446WL4MW2X57JVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/action/storage_attestation","attest_author":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/action/author_attestation","sign_citation":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/action/citation_signature","submit_replication":"https://pith.science/pith/USA4Z2DCUNI446WL4MW2X57JVY/action/replication_record"}},"created_at":"2026-05-17T23:42:49.039468+00:00","updated_at":"2026-05-17T23:42:49.039468+00:00"}