{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V5YGLB45IF74WK26P3YX3FEAZR","short_pith_number":"pith:V5YGLB45","schema_version":"1.0","canonical_sha256":"af7065879d417fcb2b5e7ef17d9480cc5e66b4e53580a48364de4e0fae544f5a","source":{"kind":"arxiv","id":"1207.2094","version":3},"attestation_state":"computed","paper":{"title":"The Capacity of More Capable Cognitive Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mojtaba Vaezi","submitted_at":"2012-07-09T16:30:09Z","abstract_excerpt":"We establish the capacity region for a class of discrete memoryless cognitive interference channel (DM-CIC) called cognitive-more-capable channel, and we show that superposition coding is the optimal encoding technique. This is the largest capacity region for the DM-CIC to date, as the existing capacity results are explicitly shown to be its subsets."},"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.2094","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T16:30:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e8c3325f9f2024e95ea6726aa66484d1fc090fbd337fc39854d2d1aec0b5b53","abstract_canon_sha256":"a0c8c571c0bd28860d419ac9751b397f1b37dc58e65030e77b740bc3d209b77c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:47.063209Z","signature_b64":"ji70oLQxp3HP4/x0SGPvY1SVofZobvWt/jLuIEJ/H0Ura2Ve9P6rzu2VomRXcITF37jPfYrutP8/ErKcHqbhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7065879d417fcb2b5e7ef17d9480cc5e66b4e53580a48364de4e0fae544f5a","last_reissued_at":"2026-05-18T03:01:47.062309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:47.062309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of More Capable Cognitive Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mojtaba Vaezi","submitted_at":"2012-07-09T16:30:09Z","abstract_excerpt":"We establish the capacity region for a class of discrete memoryless cognitive interference channel (DM-CIC) called cognitive-more-capable channel, and we show that superposition coding is the optimal encoding technique. This is the largest capacity region for the DM-CIC to date, as the existing capacity results are explicitly shown to be its subsets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2094","kind":"arxiv","version":3},"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.2094","created_at":"2026-05-18T03:01:47.062472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2094v3","created_at":"2026-05-18T03:01:47.062472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2094","created_at":"2026-05-18T03:01:47.062472+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5YGLB45IF74","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5YGLB45IF74WK26","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5YGLB45","created_at":"2026-05-18T12:27:25.539911+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/V5YGLB45IF74WK26P3YX3FEAZR","json":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR.json","graph_json":"https://pith.science/api/pith-number/V5YGLB45IF74WK26P3YX3FEAZR/graph.json","events_json":"https://pith.science/api/pith-number/V5YGLB45IF74WK26P3YX3FEAZR/events.json","paper":"https://pith.science/paper/V5YGLB45"},"agent_actions":{"view_html":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR","download_json":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR.json","view_paper":"https://pith.science/paper/V5YGLB45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2094&json=true","fetch_graph":"https://pith.science/api/pith-number/V5YGLB45IF74WK26P3YX3FEAZR/graph.json","fetch_events":"https://pith.science/api/pith-number/V5YGLB45IF74WK26P3YX3FEAZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR/action/storage_attestation","attest_author":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR/action/author_attestation","sign_citation":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR/action/citation_signature","submit_replication":"https://pith.science/pith/V5YGLB45IF74WK26P3YX3FEAZR/action/replication_record"}},"created_at":"2026-05-18T03:01:47.062472+00:00","updated_at":"2026-05-18T03:01:47.062472+00:00"}