{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZXA4XK2PZRZVV2NZ5L3VDME2X2","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":"84ef5e02df0c449abf6b1ef3a35564a881e16b59f8468b7cc48727029f5083c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:29:28Z","title_canon_sha256":"8988c4fd9270975eb5886f27be129b1967c81c4fb985ac482665b7944f1cfb2a"},"schema_version":"1.0","source":{"id":"1207.3050","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3050","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3050v2","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3050","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZXA4XK2PZRZV","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZXA4XK2PZRZVV2NZ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZXA4XK2P","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:085d3577d90e2136372b0ef448a03ac70455b330f5530499fe88631f7c6a5e31","target":"graph","created_at":"2026-05-18T03:33:38Z","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":"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","authors_text":"Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:29:28Z","title":"How Much Rate Splitting Is Required for a Random Coding Scheme? A new Achievable Rate Region for the Broadcast Channel with Cognitive Relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3050","kind":"arxiv","version":2},"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:75be217f39bde0072efa1c308abfdae460990b499d469a22ed13d44f338b76b2","target":"record","created_at":"2026-05-18T03:33:38Z","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":"84ef5e02df0c449abf6b1ef3a35564a881e16b59f8468b7cc48727029f5083c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T18:29:28Z","title_canon_sha256":"8988c4fd9270975eb5886f27be129b1967c81c4fb985ac482665b7944f1cfb2a"},"schema_version":"1.0","source":{"id":"1207.3050","kind":"arxiv","version":2}},"canonical_sha256":"cdc1cbab4fcc735ae9b9eaf751b09abe9c77736de14f77609b93da69d2d41fa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdc1cbab4fcc735ae9b9eaf751b09abe9c77736de14f77609b93da69d2d41fa7","first_computed_at":"2026-05-18T03:33:38.184785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.184785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8eDvVRoligbUxxsCKsT9X/15oPu8KGTcrY8gtk/t+logtnkJtJvoW98ivFtYAi4h3vlH+deIWvpnSseWY72QCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.185649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3050","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75be217f39bde0072efa1c308abfdae460990b499d469a22ed13d44f338b76b2","sha256:085d3577d90e2136372b0ef448a03ac70455b330f5530499fe88631f7c6a5e31"],"state_sha256":"aa6d206ac37f3fe27430e6c3d6bf0515abd6fbcf03452548c2415d8ca55b958b"}