{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DC7SOMCUU4FREEBKX55JINWCL7","short_pith_number":"pith:DC7SOMCU","canonical_record":{"source":{"id":"1602.02294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-06T19:35:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5b99233fba52978a2b429dd0cd384842727b5a9008655a9e94ea789f603e5ca","abstract_canon_sha256":"92383b6a23f22058450d1f1c57df80992be42f1abd516af68388c98e990109cf"},"schema_version":"1.0"},"canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","source":{"kind":"arxiv","id":"1602.02294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02294","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02294v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02294","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"DC7SOMCUU4FR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DC7SOMCUU4FREEBK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DC7SOMCU","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DC7SOMCUU4FREEBKX55JINWCL7","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-06T19:35:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5b99233fba52978a2b429dd0cd384842727b5a9008655a9e94ea789f603e5ca","abstract_canon_sha256":"92383b6a23f22058450d1f1c57df80992be42f1abd516af68388c98e990109cf"},"schema_version":"1.0"},"canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.400145Z","signature_b64":"vjDVWwR2O++gbnotlHR6c1KDTXrXC/EeoRZ/+w5Apo+9yYtMKCEVEv32qGosmtSfwgJ5JDSLFNYinH85x9EICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","last_reissued_at":"2026-05-18T01:21:10.399540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.399540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02294","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZJOLCdSLfffoITuCq/zTM3Pkg8AC+JpkeJ4sEec7l8cRARVt6z0nrST3HIWaNoicTiNUWfnGmihX71EJ0bSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:58:29.361006Z"},"content_sha256":"bfa2486231cd90a472ed15cff6895302704cfb30afcdde0a7afbd40e280248ad","schema_version":"1.0","event_id":"sha256:bfa2486231cd90a472ed15cff6895302704cfb30afcdde0a7afbd40e280248ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DC7SOMCUU4FREEBKX55JINWCL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Source-Channel Separation Theorem with Application to the Source Broadcast Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Kia Khezeli","submitted_at":"2016-02-06T19:35:19Z","abstract_excerpt":"A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be leveraged, via a reduction argument, to establish a necessary condition for the original problem, which unifies several existing results in the literature. Somewhat surprisingly, this method, albeit based on the source-channel separation theorem, can be used to prove the optimality of non-separation based schemes and determine the performance limits in cert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02294","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-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxKQ6bgsiTH2f3aAEPdwZo/tSxNji9/Cu3vyts4/QLNGqXmOYJvwTNRSt0TCghTC8zPSSrMVRixghK9l6NcnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:58:29.361349Z"},"content_sha256":"22ca8fdac5bba474680d0b639b2537d42d39a06bf3b67d550b1acf5cd8d21a13","schema_version":"1.0","event_id":"sha256:22ca8fdac5bba474680d0b639b2537d42d39a06bf3b67d550b1acf5cd8d21a13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/bundle.json","state_url":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DC7SOMCUU4FREEBKX55JINWCL7/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-30T12:58:29Z","links":{"resolver":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7","bundle":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/bundle.json","state":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DC7SOMCUU4FREEBKX55JINWCL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DC7SOMCUU4FREEBKX55JINWCL7","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":"92383b6a23f22058450d1f1c57df80992be42f1abd516af68388c98e990109cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-06T19:35:19Z","title_canon_sha256":"b5b99233fba52978a2b429dd0cd384842727b5a9008655a9e94ea789f603e5ca"},"schema_version":"1.0","source":{"id":"1602.02294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02294","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02294v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02294","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"DC7SOMCUU4FR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DC7SOMCUU4FREEBK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DC7SOMCU","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:22ca8fdac5bba474680d0b639b2537d42d39a06bf3b67d550b1acf5cd8d21a13","target":"graph","created_at":"2026-05-18T01:21:10Z","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":"A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be leveraged, via a reduction argument, to establish a necessary condition for the original problem, which unifies several existing results in the literature. Somewhat surprisingly, this method, albeit based on the source-channel separation theorem, can be used to prove the optimality of non-separation based schemes and determine the performance limits in cert","authors_text":"Jun Chen, Kia Khezeli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-06T19:35:19Z","title":"A Source-Channel Separation Theorem with Application to the Source Broadcast Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02294","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:bfa2486231cd90a472ed15cff6895302704cfb30afcdde0a7afbd40e280248ad","target":"record","created_at":"2026-05-18T01:21:10Z","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":"92383b6a23f22058450d1f1c57df80992be42f1abd516af68388c98e990109cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-06T19:35:19Z","title_canon_sha256":"b5b99233fba52978a2b429dd0cd384842727b5a9008655a9e94ea789f603e5ca"},"schema_version":"1.0","source":{"id":"1602.02294","kind":"arxiv","version":1}},"canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","first_computed_at":"2026-05-18T01:21:10.399540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.399540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vjDVWwR2O++gbnotlHR6c1KDTXrXC/EeoRZ/+w5Apo+9yYtMKCEVEv32qGosmtSfwgJ5JDSLFNYinH85x9EICg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.400145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfa2486231cd90a472ed15cff6895302704cfb30afcdde0a7afbd40e280248ad","sha256:22ca8fdac5bba474680d0b639b2537d42d39a06bf3b67d550b1acf5cd8d21a13"],"state_sha256":"f00d15e85e45236220a55a023fed40b5f63adbdd98d2a532ef63fc4f4ee8dda4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yNSeSK21yaNrVyLSH51pvLTMf/jPfUCeW+AT4qkbg5R8epCkwYE4SJoQ87kVDRobXPUS9hsUZ63ME6hHUrcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T12:58:29.363166Z","bundle_sha256":"e31c75686c78ebbd8e48c3e5796d498ada4246262cc0d5441d2c795248ca7281"}}