{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKHY6WE43BQBWCADXOMA2RRG7I","short_pith_number":"pith:KKHY6WE4","canonical_record":{"source":{"id":"1604.00454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b9f827e34c9b71f927bbbd8d2d4ddcc00a7505abb1ca06c689ddd0c4de0ec9a","abstract_canon_sha256":"7dff949d4be1eea48a14d17f54adb4a0f71ee8ae31b20c11d64fc09a29a58df5"},"schema_version":"1.0"},"canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","source":{"kind":"arxiv","id":"1604.00454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00454","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00454v2","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00454","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"KKHY6WE43BQB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKHY6WE43BQBWCAD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKHY6WE4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKHY6WE43BQBWCADXOMA2RRG7I","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b9f827e34c9b71f927bbbd8d2d4ddcc00a7505abb1ca06c689ddd0c4de0ec9a","abstract_canon_sha256":"7dff949d4be1eea48a14d17f54adb4a0f71ee8ae31b20c11d64fc09a29a58df5"},"schema_version":"1.0"},"canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:28.426782Z","signature_b64":"wDg4KwbppMlP9zdAsWkQLscUNFSAQXM++eb19fYTB4Woaj/YikQvlXNvRjegpNLCMPb6RIM9k1btqUmwpkoKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","last_reissued_at":"2026-05-18T01:17:28.426147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:28.426147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00454","source_version":2,"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-18T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99IaPvrKPaZcq/3kz6zLo4SjxbYhC59I7/Piv2XrnebkQbEczDtPTOy+lMx61IvIiFkGQmty340c57hR+QEbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:15:16.697691Z"},"content_sha256":"010a18d774a07a8be30da3f26a3ce24c1b7ba683a6f735197edfa3530897594b","schema_version":"1.0","event_id":"sha256:010a18d774a07a8be30da3f26a3ce24c1b7ba683a6f735197edfa3530897594b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKHY6WE43BQBWCADXOMA2RRG7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Min Ye","submitted_at":"2016-04-02T03:16:54Z","abstract_excerpt":"Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is used to encode data in a distributed storage system. It is known that if $h$ out of the $n$ nodes are inaccessible and $d$ surviving (helper) nodes are used to recover the lost data, then we need to download at least $h/(d+h-k)$ fraction of the data stored in each of the helper nodes (Dimakis et. al., 2010 and Cadambe et al., 2013). If this lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00454","kind":"arxiv","version":2},"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-18T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgwgZ3iRsEiFwX5KALTxyoGbd98QF2UHS0AvAkQsSaSNqq6NV3KkxuLY2GlUD21S4TD9fX9/QwHID1YnSzOQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:15:16.698388Z"},"content_sha256":"6273cede9238bfb890d5a8d095f9096046922b2019b18e2b616a34931615ed1f","schema_version":"1.0","event_id":"sha256:6273cede9238bfb890d5a8d095f9096046922b2019b18e2b616a34931615ed1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/bundle.json","state_url":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKHY6WE43BQBWCADXOMA2RRG7I/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-06-07T07:15:16Z","links":{"resolver":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I","bundle":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/bundle.json","state":"https://pith.science/pith/KKHY6WE43BQBWCADXOMA2RRG7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKHY6WE43BQBWCADXOMA2RRG7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKHY6WE43BQBWCADXOMA2RRG7I","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":"7dff949d4be1eea48a14d17f54adb4a0f71ee8ae31b20c11d64fc09a29a58df5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","title_canon_sha256":"0b9f827e34c9b71f927bbbd8d2d4ddcc00a7505abb1ca06c689ddd0c4de0ec9a"},"schema_version":"1.0","source":{"id":"1604.00454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00454","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00454v2","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00454","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"KKHY6WE43BQB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKHY6WE43BQBWCAD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKHY6WE4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:6273cede9238bfb890d5a8d095f9096046922b2019b18e2b616a34931615ed1f","target":"graph","created_at":"2026-05-18T01:17:28Z","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 optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is used to encode data in a distributed storage system. It is known that if $h$ out of the $n$ nodes are inaccessible and $d$ surviving (helper) nodes are used to recover the lost data, then we need to download at least $h/(d+h-k)$ fraction of the data stored in each of the helper nodes (Dimakis et. al., 2010 and Cadambe et al., 2013). If this lower ","authors_text":"Alexander Barg, Min Ye","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00454","kind":"arxiv","version":2},"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:010a18d774a07a8be30da3f26a3ce24c1b7ba683a6f735197edfa3530897594b","target":"record","created_at":"2026-05-18T01:17:28Z","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":"7dff949d4be1eea48a14d17f54adb4a0f71ee8ae31b20c11d64fc09a29a58df5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-02T03:16:54Z","title_canon_sha256":"0b9f827e34c9b71f927bbbd8d2d4ddcc00a7505abb1ca06c689ddd0c4de0ec9a"},"schema_version":"1.0","source":{"id":"1604.00454","kind":"arxiv","version":2}},"canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"528f8f589cd8601b0803bb980d4626fa109dc053d8352fc99c29ae59bff70f97","first_computed_at":"2026-05-18T01:17:28.426147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:28.426147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wDg4KwbppMlP9zdAsWkQLscUNFSAQXM++eb19fYTB4Woaj/YikQvlXNvRjegpNLCMPb6RIM9k1btqUmwpkoKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:28.426782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:010a18d774a07a8be30da3f26a3ce24c1b7ba683a6f735197edfa3530897594b","sha256:6273cede9238bfb890d5a8d095f9096046922b2019b18e2b616a34931615ed1f"],"state_sha256":"6ce1805909148a75a6db2a23cdbd221260db9833c8dd7b37355cd581b0413664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VEPmgBhv/WEgPLFDyrBP8ZCk8yxejMvMKvyLeWpr2HrNc++rzuFtGXZ6qV6BazIlfFF+45K4PkOlMhxSo2TBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:15:16.702009Z","bundle_sha256":"8dee7324effe139d3bc1ba8d680cafcfa0ecfd983e90e9541a73f87a6b2a2618"}}