{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7CI5QMGTNGMBU4VT7PBJKMIWCQ","short_pith_number":"pith:7CI5QMGT","schema_version":"1.0","canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","source":{"kind":"arxiv","id":"1608.08907","version":2},"attestation_state":"computed","paper":{"title":"Approximate Capacity of the Two-User Gaussian Interference Channel with Noisy Channel-Output Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I\\~naki Esnaola, Jean-Marie Gorce, Samir M. Perlaza, Victor Quintero","submitted_at":"2016-08-31T15:15:46Z","abstract_excerpt":"In this research report, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and three well-known techniques: rate splitting, superposition coding and backward decoding. The converse region is obtained using some of the existing perfect-output feedback outer-bounds as well as a set of new outer-bounds that are obtained by using genie-aided models of the original G-IC-NOF. Finally, it is shown that the achievability region and "},"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":"1608.08907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-31T15:15:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3849b6a0b37cbee5541da478b4d7231846e65104859fb612e3ac3b9a0d9cadee","abstract_canon_sha256":"c61f737442d480b865abe1e01e6c6ed056771670847265d20c2b96461ae212d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:50.844084Z","signature_b64":"RMQfAlrTFViwSQlRNaFahPEB9CRI8gcxj3QkurAoddJS3x2CWX953LgtDQunMHXYVnpBGGrNCBd4lbfbbwDiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","last_reissued_at":"2026-05-18T00:58:50.843378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:50.843378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Capacity of the Two-User Gaussian Interference Channel with Noisy Channel-Output Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I\\~naki Esnaola, Jean-Marie Gorce, Samir M. Perlaza, Victor Quintero","submitted_at":"2016-08-31T15:15:46Z","abstract_excerpt":"In this research report, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and three well-known techniques: rate splitting, superposition coding and backward decoding. The converse region is obtained using some of the existing perfect-output feedback outer-bounds as well as a set of new outer-bounds that are obtained by using genie-aided models of the original G-IC-NOF. Finally, it is shown that the achievability region and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08907","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":"1608.08907","created_at":"2026-05-18T00:58:50.843500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08907v2","created_at":"2026-05-18T00:58:50.843500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08907","created_at":"2026-05-18T00:58:50.843500+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CI5QMGTNGMB","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CI5QMGTNGMBU4VT","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CI5QMGT","created_at":"2026-05-18T12:30:04.600751+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/7CI5QMGTNGMBU4VT7PBJKMIWCQ","json":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ.json","graph_json":"https://pith.science/api/pith-number/7CI5QMGTNGMBU4VT7PBJKMIWCQ/graph.json","events_json":"https://pith.science/api/pith-number/7CI5QMGTNGMBU4VT7PBJKMIWCQ/events.json","paper":"https://pith.science/paper/7CI5QMGT"},"agent_actions":{"view_html":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ","download_json":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ.json","view_paper":"https://pith.science/paper/7CI5QMGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08907&json=true","fetch_graph":"https://pith.science/api/pith-number/7CI5QMGTNGMBU4VT7PBJKMIWCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7CI5QMGTNGMBU4VT7PBJKMIWCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/action/storage_attestation","attest_author":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/action/author_attestation","sign_citation":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/action/citation_signature","submit_replication":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/action/replication_record"}},"created_at":"2026-05-18T00:58:50.843500+00:00","updated_at":"2026-05-18T00:58:50.843500+00:00"}