{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WI5N7FNTMPHLUEWQU4RD3V374X","short_pith_number":"pith:WI5N7FNT","schema_version":"1.0","canonical_sha256":"b23adf95b363ceba12d0a7223dd77fe5ea0fbfaabc18b3bbfe850b14eb247c6d","source":{"kind":"arxiv","id":"0901.3809","version":1},"attestation_state":"computed","paper":{"title":"Interference channel capacity region for randomized fixed-composition codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Chang","submitted_at":"2009-01-24T01:36:31Z","abstract_excerpt":"The randomized fixe-composition with optimal decoding error exponents are studied \\cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the capacity region of the randomized fixed-composition coding scheme. A complete characterization of the capacity region of the said coding scheme is given. The inner bound is derived by showing the existence of a positive error exponent within the capacity region. A simple universal decoding rule is given. The tight outer bound is derived by extending a technique fir"},"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":"0901.3809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-24T01:36:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"358a4c9f0d859bea67fefaf8794cd4d1438ffecbd83f481808295b14d5140ab6","abstract_canon_sha256":"ea9c1e2ae8284aaf842b2c94c0594372e531c519c71a207165b39373ff3859b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.491436Z","signature_b64":"iQOq9uVGnOL9o4CR8lzgwUa/c2wRI7YjeelSdMp9tsyUXBe7JVl8DbOb6oh2TqhkvF9qCf34HlSV78nDIpQPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b23adf95b363ceba12d0a7223dd77fe5ea0fbfaabc18b3bbfe850b14eb247c6d","last_reissued_at":"2026-05-18T00:59:11.490760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.490760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference channel capacity region for randomized fixed-composition codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Chang","submitted_at":"2009-01-24T01:36:31Z","abstract_excerpt":"The randomized fixe-composition with optimal decoding error exponents are studied \\cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the capacity region of the randomized fixed-composition coding scheme. A complete characterization of the capacity region of the said coding scheme is given. The inner bound is derived by showing the existence of a positive error exponent within the capacity region. A simple universal decoding rule is given. The tight outer bound is derived by extending a technique fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3809","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":"0901.3809","created_at":"2026-05-18T00:59:11.490842+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.3809v1","created_at":"2026-05-18T00:59:11.490842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3809","created_at":"2026-05-18T00:59:11.490842+00:00"},{"alias_kind":"pith_short_12","alias_value":"WI5N7FNTMPHL","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WI5N7FNTMPHLUEWQ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WI5N7FNT","created_at":"2026-05-18T12:26:02.257875+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/WI5N7FNTMPHLUEWQU4RD3V374X","json":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X.json","graph_json":"https://pith.science/api/pith-number/WI5N7FNTMPHLUEWQU4RD3V374X/graph.json","events_json":"https://pith.science/api/pith-number/WI5N7FNTMPHLUEWQU4RD3V374X/events.json","paper":"https://pith.science/paper/WI5N7FNT"},"agent_actions":{"view_html":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X","download_json":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X.json","view_paper":"https://pith.science/paper/WI5N7FNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.3809&json=true","fetch_graph":"https://pith.science/api/pith-number/WI5N7FNTMPHLUEWQU4RD3V374X/graph.json","fetch_events":"https://pith.science/api/pith-number/WI5N7FNTMPHLUEWQU4RD3V374X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X/action/storage_attestation","attest_author":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X/action/author_attestation","sign_citation":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X/action/citation_signature","submit_replication":"https://pith.science/pith/WI5N7FNTMPHLUEWQU4RD3V374X/action/replication_record"}},"created_at":"2026-05-18T00:59:11.490842+00:00","updated_at":"2026-05-18T00:59:11.490842+00:00"}