{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XJBIWLBOVCCJNSS7HYVGOUVS7C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b81189c0183964ab2c0d0bfff6c50a2de7f8fa7f75ee3e7ea2e44def7374ae3","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-24T21:56:31Z","title_canon_sha256":"959d6257fee868bbac37252bc7c7d0d198643c836499fcc77a907866eef01f12"},"schema_version":"1.0","source":{"id":"2501.14941","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14941","created_at":"2026-05-20T00:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14941v6","created_at":"2026-05-20T00:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14941","created_at":"2026-05-20T00:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"XJBIWLBOVCCJ","created_at":"2026-05-20T00:00:17Z"},{"alias_kind":"pith_short_16","alias_value":"XJBIWLBOVCCJNSS7","created_at":"2026-05-20T00:00:17Z"},{"alias_kind":"pith_short_8","alias_value":"XJBIWLBO","created_at":"2026-05-20T00:00:17Z"}],"graph_snapshots":[{"event_id":"sha256:c61c9ddb222afcaf769d07a8ff832560b61ff9aaa652ba425f8713c02c73eac2","target":"graph","created_at":"2026-05-20T00:00:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.14941/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amir K. Khandani","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-24T21:56:31Z","title":"On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14941","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f583f3d28a69b056dccde832989c31702a8ca51f686d7a7a84b19790ed3c42b","target":"record","created_at":"2026-05-20T00:00:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b81189c0183964ab2c0d0bfff6c50a2de7f8fa7f75ee3e7ea2e44def7374ae3","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-24T21:56:31Z","title_canon_sha256":"959d6257fee868bbac37252bc7c7d0d198643c836499fcc77a907866eef01f12"},"schema_version":"1.0","source":{"id":"2501.14941","kind":"arxiv","version":6}},"canonical_sha256":"ba428b2c2ea88496ca5f3e2a6752b2f8a7df0eb6636ac9191daead7fc90b48a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba428b2c2ea88496ca5f3e2a6752b2f8a7df0eb6636ac9191daead7fc90b48a2","first_computed_at":"2026-05-20T00:00:17.323175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:17.323175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eg510t43WtBq9F17kebmYckZZnJVCkX8OkDWb8FpYsTnFnzwdEMHIMrep+fSwhnaxHpIJHx3PK02du3FpGRLDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:17.323749Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14941","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f583f3d28a69b056dccde832989c31702a8ca51f686d7a7a84b19790ed3c42b","sha256:c61c9ddb222afcaf769d07a8ff832560b61ff9aaa652ba425f8713c02c73eac2"],"state_sha256":"5fb260f0e1e2b6f057106ac5d69a3245ae0cfed6e3adfa1c33d24e0b51ea6ead"}