{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZXA4XK2PZRZVV2NZ5L3VDME2X2","short_pith_number":"pith:ZXA4XK2P","schema_version":"1.0","canonical_sha256":"cdc1cbab4fcc735ae9b9eaf751b09abe9c77736de14f77609b93da69d2d41fa7","source":{"kind":"arxiv","id":"1207.3050","version":2},"attestation_state":"computed","paper":{"title":"How Much Rate Splitting Is Required for a Random Coding Scheme? A new Achievable Rate Region for the Broadcast Channel with Cognitive Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Reza K. Farsani","submitted_at":"2012-07-12T18:29:28Z","abstract_excerpt":"In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive Relays (BCCR) is considered. A novel achievability scheme is designed for this network. Our achievability design is derived by a systematic combination of the best known achievability schemes for the basic building blocks included in the network: the Han-Kobayashi scheme for the two-user interference channel and the Marton coding scheme for the broadcast cha"},"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":"1207.3050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:29:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8988c4fd9270975eb5886f27be129b1967c81c4fb985ac482665b7944f1cfb2a","abstract_canon_sha256":"84ef5e02df0c449abf6b1ef3a35564a881e16b59f8468b7cc48727029f5083c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.185649Z","signature_b64":"8eDvVRoligbUxxsCKsT9X/15oPu8KGTcrY8gtk/t+logtnkJtJvoW98ivFtYAi4h3vlH+deIWvpnSseWY72QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdc1cbab4fcc735ae9b9eaf751b09abe9c77736de14f77609b93da69d2d41fa7","last_reissued_at":"2026-05-18T03:33:38.184785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.184785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Much Rate Splitting Is Required for a Random Coding Scheme? A new Achievable Rate Region for the Broadcast Channel with Cognitive Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Reza K. Farsani","submitted_at":"2012-07-12T18:29:28Z","abstract_excerpt":"In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive Relays (BCCR) is considered. A novel achievability scheme is designed for this network. Our achievability design is derived by a systematic combination of the best known achievability schemes for the basic building blocks included in the network: the Han-Kobayashi scheme for the two-user interference channel and the Marton coding scheme for the broadcast cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3050","kind":"arxiv","version":2},"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":"1207.3050","created_at":"2026-05-18T03:33:38.184936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3050v2","created_at":"2026-05-18T03:33:38.184936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3050","created_at":"2026-05-18T03:33:38.184936+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXA4XK2PZRZV","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXA4XK2PZRZVV2NZ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXA4XK2P","created_at":"2026-05-18T12:27:30.460161+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/ZXA4XK2PZRZVV2NZ5L3VDME2X2","json":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2.json","graph_json":"https://pith.science/api/pith-number/ZXA4XK2PZRZVV2NZ5L3VDME2X2/graph.json","events_json":"https://pith.science/api/pith-number/ZXA4XK2PZRZVV2NZ5L3VDME2X2/events.json","paper":"https://pith.science/paper/ZXA4XK2P"},"agent_actions":{"view_html":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2","download_json":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2.json","view_paper":"https://pith.science/paper/ZXA4XK2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3050&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXA4XK2PZRZVV2NZ5L3VDME2X2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXA4XK2PZRZVV2NZ5L3VDME2X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2/action/storage_attestation","attest_author":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2/action/author_attestation","sign_citation":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2/action/citation_signature","submit_replication":"https://pith.science/pith/ZXA4XK2PZRZVV2NZ5L3VDME2X2/action/replication_record"}},"created_at":"2026-05-18T03:33:38.184936+00:00","updated_at":"2026-05-18T03:33:38.184936+00:00"}