{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:74CEBRS6EFTWZVVIUH3VFPWIFK","short_pith_number":"pith:74CEBRS6","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"},"canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","source":{"kind":"arxiv","id":"1201.1935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1935","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1935v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1935","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"74CEBRS6EFTW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"74CEBRS6EFTWZVVI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"74CEBRS6","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:74CEBRS6EFTWZVVIUH3VFPWIFK","target":"record","payload":{"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"},"canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","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"},"source_kind":"arxiv","source_id":"1201.1935","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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDp1txtxw8JWUNT5cs2ArkJ6UZ+u5nca3m6isMbXoVCqoh85Q0PqV1ZD1hslcyTZAFVR2MwvEqoPz4h4Qb0oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:15:05.789738Z"},"content_sha256":"f3463873dd78df7913addf08e6c3f1409973beb77c0967142b68215a73270ec7","schema_version":"1.0","event_id":"sha256:f3463873dd78df7913addf08e6c3f1409973beb77c0967142b68215a73270ec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:74CEBRS6EFTWZVVIUH3VFPWIFK","target":"graph","payload":{"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"},"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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEgqwz/H0wLY2Avdu1dQUgQKiEhDkpqjerHlCHYLHqh/66sw33H7qQTtRR1wgDsqB1LNgAYE9aZZDXBqsBjlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:15:05.790082Z"},"content_sha256":"30eb8e13247dcf6f2cb515e2acda211b3f522935cdb06a08edca9d8923dd6372","schema_version":"1.0","event_id":"sha256:30eb8e13247dcf6f2cb515e2acda211b3f522935cdb06a08edca9d8923dd6372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/bundle.json","state_url":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/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-06-23T13:15:05Z","links":{"resolver":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK","bundle":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/bundle.json","state":"https://pith.science/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74CEBRS6EFTWZVVIUH3VFPWIFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:74CEBRS6EFTWZVVIUH3VFPWIFK","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":"47a749159a343b41f03066dc379a5ea4e5f5bd246ad63d80f9a0c451fc998f55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:06:58Z","title_canon_sha256":"0e22c1a9c361783e4b624680f6944f1c325c90e05af4893411ace0deb68fe3c7"},"schema_version":"1.0","source":{"id":"1201.1935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1935","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1935v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1935","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"74CEBRS6EFTW","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"74CEBRS6EFTWZVVI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"74CEBRS6","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:30eb8e13247dcf6f2cb515e2acda211b3f522935cdb06a08edca9d8923dd6372","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"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","authors_text":"Anantharaman Balasubramanian, Hung D. Ly, Scott L. Miller, Shuo Li, Tie Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:06:58Z","title":"Secure Symmetrical Multilevel Diversity Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1935","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:f3463873dd78df7913addf08e6c3f1409973beb77c0967142b68215a73270ec7","target":"record","created_at":"2026-05-18T00:57:57Z","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":"47a749159a343b41f03066dc379a5ea4e5f5bd246ad63d80f9a0c451fc998f55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T22:06:58Z","title_canon_sha256":"0e22c1a9c361783e4b624680f6944f1c325c90e05af4893411ace0deb68fe3c7"},"schema_version":"1.0","source":{"id":"1201.1935","kind":"arxiv","version":1}},"canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff0440c65e21676cd6a8a1f752bec82a8b5826faa82a31b7e816069614a1445b","first_computed_at":"2026-05-18T00:57:57.117876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.117876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CBifF7SCjtsZtwA45VnXNJFZenVYbt5BBkmKt+WMzbn2gH6ku0Sm+8XrPscSPw6gjTV/yLDt0T+h5521oW/3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.118436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3463873dd78df7913addf08e6c3f1409973beb77c0967142b68215a73270ec7","sha256:30eb8e13247dcf6f2cb515e2acda211b3f522935cdb06a08edca9d8923dd6372"],"state_sha256":"d0b30b0acc8ef2d60d68f9e9b6d15764ae33c395315f7e8fe7d7a51abe73bfaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UKJ3B4Glx7gVAldjsOyALWFS20m4LJQpBqrLj4EK833s9Ng+eDBQ5z+gFeH/aGRO+6bfk36sb1ti1jyz8BGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:15:05.792463Z","bundle_sha256":"17a0765487741c771999e7301c67678656ba1db585a0089672ffcbcd5b68248f"}}