{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EEDMPI7NAQAG7KUICB47FXALYI","short_pith_number":"pith:EEDMPI7N","schema_version":"1.0","canonical_sha256":"2106c7a3ed04006faa881079f2dc0bc22741177ff177eb296a6328bf2cb8b215","source":{"kind":"arxiv","id":"1712.03326","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.03326","created_at":"2026-05-18T00:00:59.636804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03326v1","created_at":"2026-05-18T00:00:59.636804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03326","created_at":"2026-05-18T00:00:59.636804+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEDMPI7NAQAG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEDMPI7NAQAG7KUI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEDMPI7N","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI","json":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI.json","graph_json":"https://pith.science/api/pith-number/EEDMPI7NAQAG7KUICB47FXALYI/graph.json","events_json":"https://pith.science/api/pith-number/EEDMPI7NAQAG7KUICB47FXALYI/events.json","paper":"https://pith.science/paper/EEDMPI7N"},"agent_actions":{"view_html":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI","download_json":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI.json","view_paper":"https://pith.science/paper/EEDMPI7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03326&json=true","fetch_graph":"https://pith.science/api/pith-number/EEDMPI7NAQAG7KUICB47FXALYI/graph.json","fetch_events":"https://pith.science/api/pith-number/EEDMPI7NAQAG7KUICB47FXALYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/action/storage_attestation","attest_author":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/action/author_attestation","sign_citation":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/action/citation_signature","submit_replication":"https://pith.science/pith/EEDMPI7NAQAG7KUICB47FXALYI/action/replication_record"}},"created_at":"2026-05-18T00:00:59.636804+00:00","updated_at":"2026-05-18T00:00:59.636804+00:00"}