{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XJBIWLBOVCCJNSS7HYVGOUVS7C","short_pith_number":"pith:XJBIWLBO","schema_version":"1.0","canonical_sha256":"ba428b2c2ea88496ca5f3e2a6752b2f8a7df0eb6636ac9191daead7fc90b48a2","source":{"kind":"arxiv","id":"2501.14941","version":6},"attestation_state":"computed","paper":{"title":"On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani","submitted_at":"2025-01-24T21:56:31Z","abstract_excerpt":"This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a corner point with Gaussian code-books, and relying on calculus of variation, it is shown that the end point in each step is achieved using Gaussian code-books. Optimality of Gaussian code-books is first established by limiting the random coding to independent and identically distributed scalar (single-letter) samples. Then, it is shown that the value of any opti"},"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":"2501.14941","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-24T21:56:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"959d6257fee868bbac37252bc7c7d0d198643c836499fcc77a907866eef01f12","abstract_canon_sha256":"2b81189c0183964ab2c0d0bfff6c50a2de7f8fa7f75ee3e7ea2e44def7374ae3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:17.323749Z","signature_b64":"Eg510t43WtBq9F17kebmYckZZnJVCkX8OkDWb8FpYsTnFnzwdEMHIMrep+fSwhnaxHpIJHx3PK02du3FpGRLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba428b2c2ea88496ca5f3e2a6752b2f8a7df0eb6636ac9191daead7fc90b48a2","last_reissued_at":"2026-05-20T00:00:17.323175Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:17.323175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani","submitted_at":"2025-01-24T21:56:31Z","abstract_excerpt":"This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a corner point with Gaussian code-books, and relying on calculus of variation, it is shown that the end point in each step is achieved using Gaussian code-books. Optimality of Gaussian code-books is first established by limiting the random coding to independent and identically distributed scalar (single-letter) samples. Then, it is shown that the value of any opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14941","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.14941/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.14941","created_at":"2026-05-20T00:00:17.323267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14941v6","created_at":"2026-05-20T00:00:17.323267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14941","created_at":"2026-05-20T00:00:17.323267+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJBIWLBOVCCJ","created_at":"2026-05-20T00:00:17.323267+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJBIWLBOVCCJNSS7","created_at":"2026-05-20T00:00:17.323267+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJBIWLBO","created_at":"2026-05-20T00:00:17.323267+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/XJBIWLBOVCCJNSS7HYVGOUVS7C","json":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C.json","graph_json":"https://pith.science/api/pith-number/XJBIWLBOVCCJNSS7HYVGOUVS7C/graph.json","events_json":"https://pith.science/api/pith-number/XJBIWLBOVCCJNSS7HYVGOUVS7C/events.json","paper":"https://pith.science/paper/XJBIWLBO"},"agent_actions":{"view_html":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C","download_json":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C.json","view_paper":"https://pith.science/paper/XJBIWLBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14941&json=true","fetch_graph":"https://pith.science/api/pith-number/XJBIWLBOVCCJNSS7HYVGOUVS7C/graph.json","fetch_events":"https://pith.science/api/pith-number/XJBIWLBOVCCJNSS7HYVGOUVS7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C/action/storage_attestation","attest_author":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C/action/author_attestation","sign_citation":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C/action/citation_signature","submit_replication":"https://pith.science/pith/XJBIWLBOVCCJNSS7HYVGOUVS7C/action/replication_record"}},"created_at":"2026-05-20T00:00:17.323267+00:00","updated_at":"2026-05-20T00:00:17.323267+00:00"}