{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OPM6UNDZDUPIFBINMPRYNX4YDC","short_pith_number":"pith:OPM6UNDZ","schema_version":"1.0","canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","source":{"kind":"arxiv","id":"1706.04898","version":1},"attestation_state":"computed","paper":{"title":"A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, Sheng Guan, Xin Wang","submitted_at":"2017-06-15T14:37:25Z","abstract_excerpt":"Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in an efficient manner such that each storage node only contains a small amount (i.e., 1/k) of the data and a data collector connected to any k nodes can retrieve the entire data. On the other hand, a node failure can be repaired (i.e., stored data at the failed node can be successfully recovered) by downloading data segments from other surviving nodes. In this "},"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":"1706.04898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T14:37:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b58768453e4968002c2c5ce3444d7904f1b78c7ea36756d827ae686b6c430e35","abstract_canon_sha256":"73b289cd8b6d61f54e2033f14bde89fc74690225aacd8868bcb8bbee52613b7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.619913Z","signature_b64":"BIfn6iVmaiIr5cV4elHQqdzlC8vfU1RNjZQBanVsSYWF8795p83ctv+QQ0jSRLmRJBB1XJZ9pBAcvctTqtRrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","last_reissued_at":"2026-05-18T00:42:18.619208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.619208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, Sheng Guan, Xin Wang","submitted_at":"2017-06-15T14:37:25Z","abstract_excerpt":"Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in an efficient manner such that each storage node only contains a small amount (i.e., 1/k) of the data and a data collector connected to any k nodes can retrieve the entire data. On the other hand, a node failure can be repaired (i.e., stored data at the failed node can be successfully recovered) by downloading data segments from other surviving nodes. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04898","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.04898","created_at":"2026-05-18T00:42:18.619308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04898v1","created_at":"2026-05-18T00:42:18.619308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04898","created_at":"2026-05-18T00:42:18.619308+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPM6UNDZDUPI","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPM6UNDZDUPIFBIN","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPM6UNDZ","created_at":"2026-05-18T12:31:34.259226+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/OPM6UNDZDUPIFBINMPRYNX4YDC","json":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC.json","graph_json":"https://pith.science/api/pith-number/OPM6UNDZDUPIFBINMPRYNX4YDC/graph.json","events_json":"https://pith.science/api/pith-number/OPM6UNDZDUPIFBINMPRYNX4YDC/events.json","paper":"https://pith.science/paper/OPM6UNDZ"},"agent_actions":{"view_html":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC","download_json":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC.json","view_paper":"https://pith.science/paper/OPM6UNDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/OPM6UNDZDUPIFBINMPRYNX4YDC/graph.json","fetch_events":"https://pith.science/api/pith-number/OPM6UNDZDUPIFBINMPRYNX4YDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/action/storage_attestation","attest_author":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/action/author_attestation","sign_citation":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/action/citation_signature","submit_replication":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/action/replication_record"}},"created_at":"2026-05-18T00:42:18.619308+00:00","updated_at":"2026-05-18T00:42:18.619308+00:00"}