{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:74CEBRS6EFTWZVVIUH3VFPWIFK","short_pith_number":"pith:74CEBRS6","schema_version":"1.0","canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","source":{"kind":"arxiv","id":"1201.1935","version":1},"attestation_state":"computed","paper":{"title":"Secure Symmetrical Multilevel Diversity Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anantharaman Balasubramanian, Hung D. Ly, Scott L. Miller, Shuo Li, Tie Liu","submitted_at":"2012-01-09T22:06:58Z","abstract_excerpt":"Symmetrical Multilevel Diversity Coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). In this setting, a simple separate coding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate (Roche, Yeung, and Hau, 1997) and the entire admissible rate region (Yeung and Zhang, 1999) of the problem. This paper considers a natural generalization of SMDC to the secure communication setting with an additional eavesdropper. It is required that all sources need to be kept perfectly secret from the eavesdropper as long a"},"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":"1201.1935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:06:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e22c1a9c361783e4b624680f6944f1c325c90e05af4893411ace0deb68fe3c7","abstract_canon_sha256":"47a749159a343b41f03066dc379a5ea4e5f5bd246ad63d80f9a0c451fc998f55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.118436Z","signature_b64":"CBifF7SCjtsZtwA45VnXNJFZenVYbt5BBkmKt+WMzbn2gH6ku0Sm+8XrPscSPw6gjTV/yLDt0T+h5521oW/3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","last_reissued_at":"2026-05-18T00:57:57.117876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.117876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Symmetrical Multilevel Diversity Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anantharaman Balasubramanian, Hung D. Ly, Scott L. Miller, Shuo Li, Tie Liu","submitted_at":"2012-01-09T22:06:58Z","abstract_excerpt":"Symmetrical Multilevel Diversity Coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). In this setting, a simple separate coding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate (Roche, Yeung, and Hau, 1997) and the entire admissible rate region (Yeung and Zhang, 1999) of the problem. This paper considers a natural generalization of SMDC to the secure communication setting with an additional eavesdropper. It is required that all sources need to be kept perfectly secret from the eavesdropper as long a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1935","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":"1201.1935","created_at":"2026-05-18T00:57:57.117962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1935v1","created_at":"2026-05-18T00:57:57.117962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1935","created_at":"2026-05-18T00:57:57.117962+00:00"},{"alias_kind":"pith_short_12","alias_value":"74CEBRS6EFTW","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"74CEBRS6EFTWZVVI","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"74CEBRS6","created_at":"2026-05-18T12:26:56.085431+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/74CEBRS6EFTWZVVIUH3VFPWIFK","json":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK.json","graph_json":"https://pith.science/api/pith-number/74CEBRS6EFTWZVVIUH3VFPWIFK/graph.json","events_json":"https://pith.science/api/pith-number/74CEBRS6EFTWZVVIUH3VFPWIFK/events.json","paper":"https://pith.science/paper/74CEBRS6"},"agent_actions":{"view_html":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK","download_json":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK.json","view_paper":"https://pith.science/paper/74CEBRS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1935&json=true","fetch_graph":"https://pith.science/api/pith-number/74CEBRS6EFTWZVVIUH3VFPWIFK/graph.json","fetch_events":"https://pith.science/api/pith-number/74CEBRS6EFTWZVVIUH3VFPWIFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/action/storage_attestation","attest_author":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/action/author_attestation","sign_citation":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/action/citation_signature","submit_replication":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/action/replication_record"}},"created_at":"2026-05-18T00:57:57.117962+00:00","updated_at":"2026-05-18T00:57:57.117962+00:00"}