{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:LRQOBU7T63G4VFF3ASSORCPJCJ","short_pith_number":"pith:LRQOBU7T","schema_version":"1.0","canonical_sha256":"5c60e0d3f3f6cdca94bb04a4e889e91278407ad1fb481f37dff4d5dda994f963","source":{"kind":"arxiv","id":"0712.1987","version":2},"attestation_state":"computed","paper":{"title":"A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Biao Chen, Gerhard Kramer, Xiaohu Shang","submitted_at":"2007-12-12T17:34:43Z","abstract_excerpt":"A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance. This is the first concrete (finite signal-to-noise ratio) capacity result for the Gaussian interference channel w"},"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":"0712.1987","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-12-12T17:34:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcd39e7f19c0a0218b68d9ead9e1ff4344057ee66ad04e3e090f428a5df780b1","abstract_canon_sha256":"00eee406bd99e78753542d8262842c23e282bf8978b32db7643c02034521dbe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.771518Z","signature_b64":"xGPTg4jipMdEZcaNPyMuRWtIR/Yxrlwk7CBFkIvk36VSYbT8Ah2eUIC+tv3P14nQCEU9A3bCkWBJQyo22Z8DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c60e0d3f3f6cdca94bb04a4e889e91278407ad1fb481f37dff4d5dda994f963","last_reissued_at":"2026-05-18T00:57:58.771105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.771105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Biao Chen, Gerhard Kramer, Xiaohu Shang","submitted_at":"2007-12-12T17:34:43Z","abstract_excerpt":"A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance. This is the first concrete (finite signal-to-noise ratio) capacity result for the Gaussian interference channel w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1987","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":"0712.1987","created_at":"2026-05-18T00:57:58.771166+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.1987v2","created_at":"2026-05-18T00:57:58.771166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.1987","created_at":"2026-05-18T00:57:58.771166+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRQOBU7T63G4","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRQOBU7T63G4VFF3","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRQOBU7T","created_at":"2026-05-18T12:25:55.427421+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/LRQOBU7T63G4VFF3ASSORCPJCJ","json":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ.json","graph_json":"https://pith.science/api/pith-number/LRQOBU7T63G4VFF3ASSORCPJCJ/graph.json","events_json":"https://pith.science/api/pith-number/LRQOBU7T63G4VFF3ASSORCPJCJ/events.json","paper":"https://pith.science/paper/LRQOBU7T"},"agent_actions":{"view_html":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ","download_json":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ.json","view_paper":"https://pith.science/paper/LRQOBU7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.1987&json=true","fetch_graph":"https://pith.science/api/pith-number/LRQOBU7T63G4VFF3ASSORCPJCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LRQOBU7T63G4VFF3ASSORCPJCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ/action/storage_attestation","attest_author":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ/action/author_attestation","sign_citation":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ/action/citation_signature","submit_replication":"https://pith.science/pith/LRQOBU7T63G4VFF3ASSORCPJCJ/action/replication_record"}},"created_at":"2026-05-18T00:57:58.771166+00:00","updated_at":"2026-05-18T00:57:58.771166+00:00"}