{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OTV7YSCVD4CNEEJJJ7IXIWJKXC","short_pith_number":"pith:OTV7YSCV","schema_version":"1.0","canonical_sha256":"74ebfc48551f04d211294fd174592ab8a752478e2db907ba896a49df66d9df8a","source":{"kind":"arxiv","id":"1603.07554","version":5},"attestation_state":"computed","paper":{"title":"Approximate Capacity of the 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-03-24T12:56:50Z","abstract_excerpt":"In this paper, 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 the conver"},"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":"1603.07554","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-24T12:56:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"19baa39d5828da1b35f17ce7e03b303b0b27124d89a6f7a459f281c1a0216500","abstract_canon_sha256":"4c27984d47e594277a9cb4dd0ab1f9a4b6ae2dc0fb6aa98fa3fc60830ffa4ba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.763053Z","signature_b64":"P7oAx1QU6vbOCWj3ePeOSE3XYQevu2nKNe9yDmzJRgeTzKHHXDW1M4SI/AmuDZJIvo21wiNEXjDtOq4wmtLaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ebfc48551f04d211294fd174592ab8a752478e2db907ba896a49df66d9df8a","last_reissued_at":"2026-05-18T00:57:49.762419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.762419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Capacity of the 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-03-24T12:56:50Z","abstract_excerpt":"In this paper, 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 the conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07554","kind":"arxiv","version":5},"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":"1603.07554","created_at":"2026-05-18T00:57:49.762526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07554v5","created_at":"2026-05-18T00:57:49.762526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07554","created_at":"2026-05-18T00:57:49.762526+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTV7YSCVD4CN","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTV7YSCVD4CNEEJJ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTV7YSCV","created_at":"2026-05-18T12:30:36.002864+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/OTV7YSCVD4CNEEJJJ7IXIWJKXC","json":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC.json","graph_json":"https://pith.science/api/pith-number/OTV7YSCVD4CNEEJJJ7IXIWJKXC/graph.json","events_json":"https://pith.science/api/pith-number/OTV7YSCVD4CNEEJJJ7IXIWJKXC/events.json","paper":"https://pith.science/paper/OTV7YSCV"},"agent_actions":{"view_html":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC","download_json":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC.json","view_paper":"https://pith.science/paper/OTV7YSCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07554&json=true","fetch_graph":"https://pith.science/api/pith-number/OTV7YSCVD4CNEEJJJ7IXIWJKXC/graph.json","fetch_events":"https://pith.science/api/pith-number/OTV7YSCVD4CNEEJJJ7IXIWJKXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC/action/storage_attestation","attest_author":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC/action/author_attestation","sign_citation":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC/action/citation_signature","submit_replication":"https://pith.science/pith/OTV7YSCVD4CNEEJJJ7IXIWJKXC/action/replication_record"}},"created_at":"2026-05-18T00:57:49.762526+00:00","updated_at":"2026-05-18T00:57:49.762526+00:00"}