{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DC7SOMCUU4FREEBKX55JINWCL7","short_pith_number":"pith:DC7SOMCU","schema_version":"1.0","canonical_sha256":"18bf273054a70b12102abf7a9436c25fcf44c272f4721e624160b7d39746dec0","source":{"kind":"arxiv","id":"1602.02294","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02294","created_at":"2026-05-18T01:21:10.399627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02294v1","created_at":"2026-05-18T01:21:10.399627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02294","created_at":"2026-05-18T01:21:10.399627+00:00"},{"alias_kind":"pith_short_12","alias_value":"DC7SOMCUU4FR","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DC7SOMCUU4FREEBK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DC7SOMCU","created_at":"2026-05-18T12:30:12.583610+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/DC7SOMCUU4FREEBKX55JINWCL7","json":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7.json","graph_json":"https://pith.science/api/pith-number/DC7SOMCUU4FREEBKX55JINWCL7/graph.json","events_json":"https://pith.science/api/pith-number/DC7SOMCUU4FREEBKX55JINWCL7/events.json","paper":"https://pith.science/paper/DC7SOMCU"},"agent_actions":{"view_html":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7","download_json":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7.json","view_paper":"https://pith.science/paper/DC7SOMCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02294&json=true","fetch_graph":"https://pith.science/api/pith-number/DC7SOMCUU4FREEBKX55JINWCL7/graph.json","fetch_events":"https://pith.science/api/pith-number/DC7SOMCUU4FREEBKX55JINWCL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/action/storage_attestation","attest_author":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/action/author_attestation","sign_citation":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/action/citation_signature","submit_replication":"https://pith.science/pith/DC7SOMCUU4FREEBKX55JINWCL7/action/replication_record"}},"created_at":"2026-05-18T01:21:10.399627+00:00","updated_at":"2026-05-18T01:21:10.399627+00:00"}