{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEDMPI7NAQAG7KUICB47FXALYI","short_pith_number":"pith:EEDMPI7N","canonical_record":{"source":{"id":"1712.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-09T01:35:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7eacd2a7a6404a7c0ff4be1a32fc14e9df5737f18a3bd5ab1d333a032808d20","abstract_canon_sha256":"a7ae50a4f4b82c1489f5f5a72d0479351a8a157f957452aa582c2f22a0b01a8a"},"schema_version":"1.0"},"canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","source":{"kind":"arxiv","id":"1712.03326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03326","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03326v1","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03326","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"EEDMPI7NAQAG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEDMPI7NAQAG7KUI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEDMPI7N","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEDMPI7NAQAG7KUICB47FXALYI","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-09T01:35:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7eacd2a7a6404a7c0ff4be1a32fc14e9df5737f18a3bd5ab1d333a032808d20","abstract_canon_sha256":"a7ae50a4f4b82c1489f5f5a72d0479351a8a157f957452aa582c2f22a0b01a8a"},"schema_version":"1.0"},"canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:59.637266Z","signature_b64":"fbiCQac2KbBLGq+0es+P742tBg6tcjPUjnlk6gkMonvzhch+B5TnCIDGHXSLkGD1zkkoab2CXgljysWJlpbPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","last_reissued_at":"2026-05-18T00:00:59.636726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:59.636726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03326","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/RC2SPbwAW42rpcItm1OLGsjSCoIV3gPCxGq+90oyY1Oz1K2kD9qnvJvwsP03RBqjxHv4WZiemvQJH/7lyQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:49.719093Z"},"content_sha256":"41da62c15ad864cf5fdba75061b5196bbd572b0d72b6c5a3255f431d31cfe812","schema_version":"1.0","event_id":"sha256:41da62c15ad864cf5fdba75061b5196bbd572b0d72b6c5a3255f431d31cfe812"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEDMPI7NAQAG7KUICB47FXALYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Cong Shen, Shuo Shao, Tie Liu","submitted_at":"2017-12-09T01:35:04Z","abstract_excerpt":"The problem of multilevel diversity coding with secure regeneration (MDC-SR) is considered, which includes the problems of multilevel diversity coding with regeneration (MDC-R) and secure regenerating code (SRC) as special cases. Two outer bounds are established, showing that separate coding of different messages using the respective SRCs can achieve the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth tradeoff regions for the general MDC-SR problem. The core of the new converse results is an exchange lemma, which can be established usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03326","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4dSJpyIU+k05pcG6B0RriFJfxuVq7eUjBDKa1CssROB+YyjzqqLNK/5vQbZMW6vjpP8ixdDLJ2MlsvnoVOtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:49.719794Z"},"content_sha256":"d5c76750797421c8f537a30fa5646a0221f0762689648f63d2230ee216f109b9","schema_version":"1.0","event_id":"sha256:d5c76750797421c8f537a30fa5646a0221f0762689648f63d2230ee216f109b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/bundle.json","state_url":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEDMPI7NAQAG7KUICB47FXALYI/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-25T11:42:49Z","links":{"resolver":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI","bundle":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/bundle.json","state":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEDMPI7NAQAG7KUICB47FXALYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEDMPI7NAQAG7KUICB47FXALYI","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":"a7ae50a4f4b82c1489f5f5a72d0479351a8a157f957452aa582c2f22a0b01a8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-09T01:35:04Z","title_canon_sha256":"f7eacd2a7a6404a7c0ff4be1a32fc14e9df5737f18a3bd5ab1d333a032808d20"},"schema_version":"1.0","source":{"id":"1712.03326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03326","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03326v1","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03326","created_at":"2026-05-18T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"EEDMPI7NAQAG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEDMPI7NAQAG7KUI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEDMPI7N","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:d5c76750797421c8f537a30fa5646a0221f0762689648f63d2230ee216f109b9","target":"graph","created_at":"2026-05-18T00:00:59Z","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":"The problem of multilevel diversity coding with secure regeneration (MDC-SR) is considered, which includes the problems of multilevel diversity coding with regeneration (MDC-R) and secure regenerating code (SRC) as special cases. Two outer bounds are established, showing that separate coding of different messages using the respective SRCs can achieve the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth tradeoff regions for the general MDC-SR problem. The core of the new converse results is an exchange lemma, which can be established usin","authors_text":"Chao Tian, Cong Shen, Shuo Shao, Tie Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-09T01:35:04Z","title":"Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03326","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:41da62c15ad864cf5fdba75061b5196bbd572b0d72b6c5a3255f431d31cfe812","target":"record","created_at":"2026-05-18T00:00:59Z","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":"a7ae50a4f4b82c1489f5f5a72d0479351a8a157f957452aa582c2f22a0b01a8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-09T01:35:04Z","title_canon_sha256":"f7eacd2a7a6404a7c0ff4be1a32fc14e9df5737f18a3bd5ab1d333a032808d20"},"schema_version":"1.0","source":{"id":"1712.03326","kind":"arxiv","version":1}},"canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","first_computed_at":"2026-05-18T00:00:59.636726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:59.636726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fbiCQac2KbBLGq+0es+P742tBg6tcjPUjnlk6gkMonvzhch+B5TnCIDGHXSLkGD1zkkoab2CXgljysWJlpbPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:59.637266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41da62c15ad864cf5fdba75061b5196bbd572b0d72b6c5a3255f431d31cfe812","sha256:d5c76750797421c8f537a30fa5646a0221f0762689648f63d2230ee216f109b9"],"state_sha256":"03773f69a6e26807fc37652f76e37d1275d6518acda7fbca86d6dfc498bb4d99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZHGs+h3qYQ1w1X9XuYE/dN2YnrXeSLmx/rufoqj2ao1n3z59YmV3pL2D0pAPqWfS0Rj8MFXbLYogkTs4Z1gCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:42:49.722651Z","bundle_sha256":"2a1572c769e105dae2ef21781204af1d55d9d8d10ed3b9ebdf79d89ba936466b"}}