{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SXK65EXFVMEAGLPRRL3T5T4D6O","short_pith_number":"pith:SXK65EXF","schema_version":"1.0","canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","source":{"kind":"arxiv","id":"1302.1837","version":1},"attestation_state":"computed","paper":{"title":"On the Capacity Region of the Two-User Interference Channel","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":"2013-02-07T19:41:07Z","abstract_excerpt":"One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime is given for the general IC where the sum-rate capacity is achieved by treating interference as noise at the receivers. To obtain this result, a single-letter outer bound in terms of some auxiliary random variables is first established for the sum-rate capacity of the general IC and then those conditions under which this outer bound is reduced to the achieva"},"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":"1302.1837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-07T19:41:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb3c7e935c9f4e33f6f856c0da714d97fb6d62d2809b6bd486bcd0fb399c4ad4","abstract_canon_sha256":"538298e1ea6aae5135c2a1300db9b88a3865bcfa8f663902f12451fe46bde92f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:14.493454Z","signature_b64":"zfeF8H6GysAsm3uJr1bj85CZBTFaY0jZeIoKyWZUuHSAJF+826W9Ces2odEiqi1UAryyEq9HiyqQQpwt8VHECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d5ee92e5ab08032df18af73ecf83f3bf5f8d56a658b6610743ef6c2bbf2da5","last_reissued_at":"2026-05-18T03:34:14.492627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:14.492627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity Region of the Two-User Interference Channel","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":"2013-02-07T19:41:07Z","abstract_excerpt":"One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime is given for the general IC where the sum-rate capacity is achieved by treating interference as noise at the receivers. To obtain this result, a single-letter outer bound in terms of some auxiliary random variables is first established for the sum-rate capacity of the general IC and then those conditions under which this outer bound is reduced to the achieva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1837","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":"1302.1837","created_at":"2026-05-18T03:34:14.492754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1837v1","created_at":"2026-05-18T03:34:14.492754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1837","created_at":"2026-05-18T03:34:14.492754+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXK65EXFVMEA","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXK65EXFVMEAGLPR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXK65EXF","created_at":"2026-05-18T12:27:59.945178+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/SXK65EXFVMEAGLPRRL3T5T4D6O","json":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O.json","graph_json":"https://pith.science/api/pith-number/SXK65EXFVMEAGLPRRL3T5T4D6O/graph.json","events_json":"https://pith.science/api/pith-number/SXK65EXFVMEAGLPRRL3T5T4D6O/events.json","paper":"https://pith.science/paper/SXK65EXF"},"agent_actions":{"view_html":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O","download_json":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O.json","view_paper":"https://pith.science/paper/SXK65EXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1837&json=true","fetch_graph":"https://pith.science/api/pith-number/SXK65EXFVMEAGLPRRL3T5T4D6O/graph.json","fetch_events":"https://pith.science/api/pith-number/SXK65EXFVMEAGLPRRL3T5T4D6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/action/storage_attestation","attest_author":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/action/author_attestation","sign_citation":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/action/citation_signature","submit_replication":"https://pith.science/pith/SXK65EXFVMEAGLPRRL3T5T4D6O/action/replication_record"}},"created_at":"2026-05-18T03:34:14.492754+00:00","updated_at":"2026-05-18T03:34:14.492754+00:00"}