{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6DYKCE2TZPAUY5NWVOPRXOWF72","short_pith_number":"pith:6DYKCE2T","canonical_record":{"source":{"id":"1708.03402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T22:38:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22351d2fa11494f495e1661d658e86627daf66a243452be26c82838526d6a1bf","abstract_canon_sha256":"b79af2338497bad734f3333b4ea1d120f7d55595a6921ec030aa456e02af1bd4"},"schema_version":"1.0"},"canonical_sha256":"f0f0a11353cbc14c75b6ab9f1bbac5fea49817c17f3cf486a8bcb02a0bbe857d","source":{"kind":"arxiv","id":"1708.03402","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03402","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03402v2","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03402","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"6DYKCE2TZPAU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6DYKCE2TZPAUY5NW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6DYKCE2T","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6DYKCE2TZPAUY5NWVOPRXOWF72","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T22:38:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22351d2fa11494f495e1661d658e86627daf66a243452be26c82838526d6a1bf","abstract_canon_sha256":"b79af2338497bad734f3333b4ea1d120f7d55595a6921ec030aa456e02af1bd4"},"schema_version":"1.0"},"canonical_sha256":"f0f0a11353cbc14c75b6ab9f1bbac5fea49817c17f3cf486a8bcb02a0bbe857d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:04.579025Z","signature_b64":"VwDSJyNiGlQqcTr/NMc7dRlrYz62/eSa0T7SmHdNMb3TWcUwdxXDTxYO2D/yZe9aJ9Q9MeQBAXXrK7c6r8GrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f0a11353cbc14c75b6ab9f1bbac5fea49817c17f3cf486a8bcb02a0bbe857d","last_reissued_at":"2026-05-18T00:27:04.578552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:04.578552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03402","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-18T00:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quxFzNp8Rd/PlPJD8jpPx66YGtLxVNf+kDFOLZM76k1bvLtJH9LjMIGKiT+vLD4By2ie27rRwOh7g2fiMA9MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:44:03.328479Z"},"content_sha256":"4b77cc43727cf513a72b38a89f0322f70190f1b50ae039488c9986b7ff796fc4","schema_version":"1.0","event_id":"sha256:4b77cc43727cf513a72b38a89f0322f70190f1b50ae039488c9986b7ff796fc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6DYKCE2TZPAUY5NWVOPRXOWF72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Kaveh Mahdaviani, Soheil Mohajer","submitted_at":"2017-08-10T22:38:45Z","abstract_excerpt":"In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed nodes. Efficiency is then achieved by minimizing the storage overhead and the amount of data transmission required for data reconstruction and repair, provided by coding solutions such as regenerating codes [1]. Common explicit regenerating code constructions enable efficient repair through accessing a predefined number, $d$, of arbitrary chosen available nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03402","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-18T00:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYZ+adlm+HENlrOZLptivCRb3bUs57cDzz2IR07114DGbHReh+pPwNIF+ymMKJT+m5SeKCRmJge4m6c2MIDTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:44:03.328983Z"},"content_sha256":"6096abcb782926203f4f5d6450c2be298092c8bc698aa7a9ba52b38d916e40f5","schema_version":"1.0","event_id":"sha256:6096abcb782926203f4f5d6450c2be298092c8bc698aa7a9ba52b38d916e40f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/bundle.json","state_url":"https://pith.science/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/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-26T04:44:03Z","links":{"resolver":"https://pith.science/pith/6DYKCE2TZPAUY5NWVOPRXOWF72","bundle":"https://pith.science/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/bundle.json","state":"https://pith.science/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DYKCE2TZPAUY5NWVOPRXOWF72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6DYKCE2TZPAUY5NWVOPRXOWF72","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":"b79af2338497bad734f3333b4ea1d120f7d55595a6921ec030aa456e02af1bd4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T22:38:45Z","title_canon_sha256":"22351d2fa11494f495e1661d658e86627daf66a243452be26c82838526d6a1bf"},"schema_version":"1.0","source":{"id":"1708.03402","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03402","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03402v2","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03402","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"6DYKCE2TZPAU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6DYKCE2TZPAUY5NW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6DYKCE2T","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6096abcb782926203f4f5d6450c2be298092c8bc698aa7a9ba52b38d916e40f5","target":"graph","created_at":"2026-05-18T00:27:04Z","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":"In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed nodes. Efficiency is then achieved by minimizing the storage overhead and the amount of data transmission required for data reconstruction and repair, provided by coding solutions such as regenerating codes [1]. Common explicit regenerating code constructions enable efficient repair through accessing a predefined number, $d$, of arbitrary chosen available nod","authors_text":"Ashish Khisti, Kaveh Mahdaviani, Soheil Mohajer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T22:38:45Z","title":"Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03402","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:4b77cc43727cf513a72b38a89f0322f70190f1b50ae039488c9986b7ff796fc4","target":"record","created_at":"2026-05-18T00:27:04Z","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":"b79af2338497bad734f3333b4ea1d120f7d55595a6921ec030aa456e02af1bd4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T22:38:45Z","title_canon_sha256":"22351d2fa11494f495e1661d658e86627daf66a243452be26c82838526d6a1bf"},"schema_version":"1.0","source":{"id":"1708.03402","kind":"arxiv","version":2}},"canonical_sha256":"f0f0a11353cbc14c75b6ab9f1bbac5fea49817c17f3cf486a8bcb02a0bbe857d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0f0a11353cbc14c75b6ab9f1bbac5fea49817c17f3cf486a8bcb02a0bbe857d","first_computed_at":"2026-05-18T00:27:04.578552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:04.578552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VwDSJyNiGlQqcTr/NMc7dRlrYz62/eSa0T7SmHdNMb3TWcUwdxXDTxYO2D/yZe9aJ9Q9MeQBAXXrK7c6r8GrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:04.579025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03402","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b77cc43727cf513a72b38a89f0322f70190f1b50ae039488c9986b7ff796fc4","sha256:6096abcb782926203f4f5d6450c2be298092c8bc698aa7a9ba52b38d916e40f5"],"state_sha256":"2fab06249a93cf54e905d4a6dbf8a5d08ca280c5e81d734c366cae25dde65045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0j6lNldy35Ifi3/1uFCOWbkvcl3wkI6oGZZhscFu9BDhtaoUPWxsqWmhd+lgLFVjxghn7Nan+e4kTA2Wq1QVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:44:03.332333Z","bundle_sha256":"5027ba7c4c2815001fe2dbd48667002fe728276f270a61d2cfdc72de7f03de95"}}