{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OPM6UNDZDUPIFBINMPRYNX4YDC","short_pith_number":"pith:OPM6UNDZ","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"},"canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","source":{"kind":"arxiv","id":"1706.04898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04898","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04898v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04898","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"OPM6UNDZDUPI","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPM6UNDZDUPIFBIN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPM6UNDZ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OPM6UNDZDUPIFBINMPRYNX4YDC","target":"record","payload":{"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"},"canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","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"},"source_kind":"arxiv","source_id":"1706.04898","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-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqUHYrCeEnlEemcvJAYXm8+AdlDf4RXaaJ4PnshFsgDUwhAgDEX4ckgZ4ewyeE6b5C90TVjrn7pu+OvjeiqUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:18:08.807539Z"},"content_sha256":"79259e479a9e6bd26d920046e41d385c9717c50a1fb2a04f9f02c2e3c74c6133","schema_version":"1.0","event_id":"sha256:79259e479a9e6bd26d920046e41d385c9717c50a1fb2a04f9f02c2e3c74c6133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OPM6UNDZDUPIFBINMPRYNX4YDC","target":"graph","payload":{"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"},"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-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkBsYpVcWzRuA2wNKBrOuHUgy7pZelwge8jNE1q52YvNUwy5snwPfNDEFRhmhH9xmCbJ7X/27KtH56OLsQygCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:18:08.808197Z"},"content_sha256":"782d077c47d0474e66de4a98b36ce3a42f79c446740070492b68263ec242e227","schema_version":"1.0","event_id":"sha256:782d077c47d0474e66de4a98b36ce3a42f79c446740070492b68263ec242e227"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/bundle.json","state_url":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/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-27T00:18:08Z","links":{"resolver":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC","bundle":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/bundle.json","state":"https://pith.science/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPM6UNDZDUPIFBINMPRYNX4YDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OPM6UNDZDUPIFBINMPRYNX4YDC","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":"73b289cd8b6d61f54e2033f14bde89fc74690225aacd8868bcb8bbee52613b7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T14:37:25Z","title_canon_sha256":"b58768453e4968002c2c5ce3444d7904f1b78c7ea36756d827ae686b6c430e35"},"schema_version":"1.0","source":{"id":"1706.04898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04898","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04898v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04898","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"OPM6UNDZDUPI","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPM6UNDZDUPIFBIN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPM6UNDZ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:782d077c47d0474e66de4a98b36ce3a42f79c446740070492b68263ec242e227","target":"graph","created_at":"2026-05-18T00:42:18Z","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) 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 ","authors_text":"Haibin Kan, Sheng Guan, Xin Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T14:37:25Z","title":"A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04898","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:79259e479a9e6bd26d920046e41d385c9717c50a1fb2a04f9f02c2e3c74c6133","target":"record","created_at":"2026-05-18T00:42:18Z","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":"73b289cd8b6d61f54e2033f14bde89fc74690225aacd8868bcb8bbee52613b7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T14:37:25Z","title_canon_sha256":"b58768453e4968002c2c5ce3444d7904f1b78c7ea36756d827ae686b6c430e35"},"schema_version":"1.0","source":{"id":"1706.04898","kind":"arxiv","version":1}},"canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73d9ea34791d1e82850d63e386df9818b0d80e0be5cd4e6273d8565a9e1bca73","first_computed_at":"2026-05-18T00:42:18.619208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:18.619208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BIfn6iVmaiIr5cV4elHQqdzlC8vfU1RNjZQBanVsSYWF8795p83ctv+QQ0jSRLmRJBB1XJZ9pBAcvctTqtRrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:18.619913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79259e479a9e6bd26d920046e41d385c9717c50a1fb2a04f9f02c2e3c74c6133","sha256:782d077c47d0474e66de4a98b36ce3a42f79c446740070492b68263ec242e227"],"state_sha256":"ef02464c661eff7cb70e22da57f41ab8a4e34ec5110e255a8d0f3c0366ef0253"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgP6+5pJ8o5Tuz2kWhCJEwvJaXmjTC5VPipmonBbUPcoJhoQ7F33FzXt+9ekgDyylXaJgilw1LaXhr68g8DdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:18:08.811953Z","bundle_sha256":"7dea01588e474ba84a378cdb0d8d0303cb69bb9175d48075d03c4ae79cce5f48"}}