{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DO4VD5RBGDG42WY42CKXI2TMPK","short_pith_number":"pith:DO4VD5RB","canonical_record":{"source":{"id":"1106.1250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T02:23:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"991aae81f448224e6cec72f358fe851ac68006dd87d9632fb0b7851f02ed1b01","abstract_canon_sha256":"797cf7291f8d0786ab03e7f3132af0d33817d89cade2b2da17cff16907828700"},"schema_version":"1.0"},"canonical_sha256":"1bb951f62130cdcd5b1cd095746a6c7a9085dac9d59bbf4a9c953e61b395fc6d","source":{"kind":"arxiv","id":"1106.1250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1250","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1250v1","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1250","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"DO4VD5RBGDG4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DO4VD5RBGDG42WY4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DO4VD5RB","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DO4VD5RBGDG42WY42CKXI2TMPK","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T02:23:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"991aae81f448224e6cec72f358fe851ac68006dd87d9632fb0b7851f02ed1b01","abstract_canon_sha256":"797cf7291f8d0786ab03e7f3132af0d33817d89cade2b2da17cff16907828700"},"schema_version":"1.0"},"canonical_sha256":"1bb951f62130cdcd5b1cd095746a6c7a9085dac9d59bbf4a9c953e61b395fc6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:24.123540Z","signature_b64":"nY9z93bEXtXlkSN/35pV18vbft3gJ95q2BqtOArTWaX5qw91ndJF/aq4w5d0PyPeNcUUSrXwDVSYbhYOUdzsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb951f62130cdcd5b1cd095746a6c7a9085dac9d59bbf4a9c953e61b395fc6d","last_reissued_at":"2026-05-18T04:20:24.122876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:24.122876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1250","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-18T04:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyrxhdaUHkBmp5bXyIHTuo/Rtw1/WRow0Zk4M1O0TjWEkoVLYA/iRBp1y0XnHJxlF8L22nNLBik2DF1ilJ2sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:11:17.824864Z"},"content_sha256":"e3e3cb5796c29d2dd201eaebfda74de1f5e81d65f04704a37674af9cec41d5b1","schema_version":"1.0","event_id":"sha256:e3e3cb5796c29d2dd201eaebfda74de1f5e81d65f04704a37674af9cec41d5b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DO4VD5RBGDG42WY42CKXI2TMPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Huang, Jin Li, Syed A. Jafar, Viveck R. Cadambe","submitted_at":"2011-06-07T02:23:29Z","abstract_excerpt":"It is well known that an (n,k) code can be used to store 'k' units of information in 'n' unit-capacity disks of a distributed data storage system. If the code used is maximum distance separable (MDS), then the system can tolerate any (n-k) disk failures, since the original information can be recovered from any k surviving disks. The focus of this paper is the design of a systematic MDS code with the additional property that a single disk failure can be repaired with minimum repair bandwidth, i.e., with the minimum possible amount of data to be downloaded for recovery of the failed disk. Previo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1250","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-18T04:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mp1/h64+n/Pln9b1VtjuKKdlm9Hbq0yOnYz/f/7DKqqVZo8b4nX29vKI3yYF/W7c1t9ekznZlEImm8w3+Rv1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:11:17.825229Z"},"content_sha256":"d5b44874abda6f39412d5f7cc2a3ca8952d00c979c107c69bff74170f82e02c3","schema_version":"1.0","event_id":"sha256:d5b44874abda6f39412d5f7cc2a3ca8952d00c979c107c69bff74170f82e02c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO4VD5RBGDG42WY42CKXI2TMPK/bundle.json","state_url":"https://pith.science/pith/DO4VD5RBGDG42WY42CKXI2TMPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO4VD5RBGDG42WY42CKXI2TMPK/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-28T13:11:17Z","links":{"resolver":"https://pith.science/pith/DO4VD5RBGDG42WY42CKXI2TMPK","bundle":"https://pith.science/pith/DO4VD5RBGDG42WY42CKXI2TMPK/bundle.json","state":"https://pith.science/pith/DO4VD5RBGDG42WY42CKXI2TMPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO4VD5RBGDG42WY42CKXI2TMPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DO4VD5RBGDG42WY42CKXI2TMPK","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":"797cf7291f8d0786ab03e7f3132af0d33817d89cade2b2da17cff16907828700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T02:23:29Z","title_canon_sha256":"991aae81f448224e6cec72f358fe851ac68006dd87d9632fb0b7851f02ed1b01"},"schema_version":"1.0","source":{"id":"1106.1250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1250","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1250v1","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1250","created_at":"2026-05-18T04:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"DO4VD5RBGDG4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DO4VD5RBGDG42WY4","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DO4VD5RB","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:d5b44874abda6f39412d5f7cc2a3ca8952d00c979c107c69bff74170f82e02c3","target":"graph","created_at":"2026-05-18T04:20:24Z","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":"It is well known that an (n,k) code can be used to store 'k' units of information in 'n' unit-capacity disks of a distributed data storage system. If the code used is maximum distance separable (MDS), then the system can tolerate any (n-k) disk failures, since the original information can be recovered from any k surviving disks. The focus of this paper is the design of a systematic MDS code with the additional property that a single disk failure can be repaired with minimum repair bandwidth, i.e., with the minimum possible amount of data to be downloaded for recovery of the failed disk. Previo","authors_text":"Cheng Huang, Jin Li, Syed A. Jafar, Viveck R. Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T02:23:29Z","title":"Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1250","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:e3e3cb5796c29d2dd201eaebfda74de1f5e81d65f04704a37674af9cec41d5b1","target":"record","created_at":"2026-05-18T04:20:24Z","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":"797cf7291f8d0786ab03e7f3132af0d33817d89cade2b2da17cff16907828700","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T02:23:29Z","title_canon_sha256":"991aae81f448224e6cec72f358fe851ac68006dd87d9632fb0b7851f02ed1b01"},"schema_version":"1.0","source":{"id":"1106.1250","kind":"arxiv","version":1}},"canonical_sha256":"1bb951f62130cdcd5b1cd095746a6c7a9085dac9d59bbf4a9c953e61b395fc6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bb951f62130cdcd5b1cd095746a6c7a9085dac9d59bbf4a9c953e61b395fc6d","first_computed_at":"2026-05-18T04:20:24.122876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:24.122876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nY9z93bEXtXlkSN/35pV18vbft3gJ95q2BqtOArTWaX5qw91ndJF/aq4w5d0PyPeNcUUSrXwDVSYbhYOUdzsAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:24.123540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3e3cb5796c29d2dd201eaebfda74de1f5e81d65f04704a37674af9cec41d5b1","sha256:d5b44874abda6f39412d5f7cc2a3ca8952d00c979c107c69bff74170f82e02c3"],"state_sha256":"b5ef952c6f5e493500a92a4da9cb55edf566600f0b4477d76e80b9de4a6ad8dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqa3dRmZHKwAZuEl91mLRWPrnaRPpie4t9PLo8F0aJgZ0xXs0MKqW3MiR3fsmEa03DtxT8km13lTRqy7HHppCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:11:17.827522Z","bundle_sha256":"16525ecfbb465df8d3bd6eb69f7a4d498d2cb0d5115640418798a7e65a5215d7"}}