{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZYI5UUWZLV235HBWWSVJLACC3V","short_pith_number":"pith:ZYI5UUWZ","schema_version":"1.0","canonical_sha256":"ce11da52d95d75be9c36b4aa958042dd471bd46b3b4757914e9af18af1ef1a53","source":{"kind":"arxiv","id":"1101.1920","version":2},"attestation_state":"computed","paper":{"title":"Superposition Coding-Based Bounds and Capacity for the Cognitive Z-Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mai Vu, Mojtaba Vaezi","submitted_at":"2011-01-10T18:41:46Z","abstract_excerpt":"This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete memoryless more capable CIC, which is an extension to the more capable broadcast channel (BC). Using superposition coding, we propose an inner bound and an outer bound on its capacity region. The outer bound is also valid when the primary user is under strong interference. For the Gaussian CIC, this outer bound applies for $|a| \\geq 1 $, where $a$ is the gai"},"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":"1101.1920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-10T18:41:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4025344a3014aa4e7d7be44af10d8bba565f5dadebe55db108620388679fe79","abstract_canon_sha256":"2b8875ee1e93d2171ce5225a39aeb3e852bc70c85a0fed2119ce62d3ddb7e837"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:55.284641Z","signature_b64":"pJXsR+qH8Oly5pciyGsdvy/VDOnnpjOQc6n4lCpLDbDkeFOeMSaS4NDY5nfyfDe4q5BbB7Tff0vnYnCvdxcjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce11da52d95d75be9c36b4aa958042dd471bd46b3b4757914e9af18af1ef1a53","last_reissued_at":"2026-05-18T04:29:55.284127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:55.284127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superposition Coding-Based Bounds and Capacity for the Cognitive Z-Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mai Vu, Mojtaba Vaezi","submitted_at":"2011-01-10T18:41:46Z","abstract_excerpt":"This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete memoryless more capable CIC, which is an extension to the more capable broadcast channel (BC). Using superposition coding, we propose an inner bound and an outer bound on its capacity region. The outer bound is also valid when the primary user is under strong interference. For the Gaussian CIC, this outer bound applies for $|a| \\geq 1 $, where $a$ is the gai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1920","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":"1101.1920","created_at":"2026-05-18T04:29:55.284195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1920v2","created_at":"2026-05-18T04:29:55.284195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1920","created_at":"2026-05-18T04:29:55.284195+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYI5UUWZLV23","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYI5UUWZLV235HBW","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYI5UUWZ","created_at":"2026-05-18T12:26:50.516681+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/ZYI5UUWZLV235HBWWSVJLACC3V","json":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V.json","graph_json":"https://pith.science/api/pith-number/ZYI5UUWZLV235HBWWSVJLACC3V/graph.json","events_json":"https://pith.science/api/pith-number/ZYI5UUWZLV235HBWWSVJLACC3V/events.json","paper":"https://pith.science/paper/ZYI5UUWZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V","download_json":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V.json","view_paper":"https://pith.science/paper/ZYI5UUWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1920&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYI5UUWZLV235HBWWSVJLACC3V/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYI5UUWZLV235HBWWSVJLACC3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V/action/storage_attestation","attest_author":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V/action/author_attestation","sign_citation":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V/action/citation_signature","submit_replication":"https://pith.science/pith/ZYI5UUWZLV235HBWWSVJLACC3V/action/replication_record"}},"created_at":"2026-05-18T04:29:55.284195+00:00","updated_at":"2026-05-18T04:29:55.284195+00:00"}