{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SCOINCFOJDN2IUSR4L7AJTY635","short_pith_number":"pith:SCOINCFO","schema_version":"1.0","canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","source":{"kind":"arxiv","id":"1611.05322","version":3},"attestation_state":"computed","paper":{"title":"Approximate Capacity Region 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-11-15T14:44:47Z","abstract_excerpt":"In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting; block-Markov superposition coding; and backward decoding. The proof of converse reuses some of the existing outer bounds and includes new ones obtained using genie-aided models. Following the insight gained from the analysis of the LD-IC-NF, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output fe"},"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":"1611.05322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:44:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e46c6cf12cef986eef2c0b904a7242846533db3607f8d96651a371e1a05aa328","abstract_canon_sha256":"0b02b4c6339d4c314398d88419e820093163798d6ef33b674709cfe8c2d2b502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.948222Z","signature_b64":"9/n3Pz1HTyH3oqt14eHhDaO3ZvKrYa0Xxks8uM7A4uPrg0Z9HNK4ZOZbXL5H/fv9s2QLy2uV9RQ2mWffDfrnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","last_reissued_at":"2026-05-18T00:15:37.947710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.947710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Capacity Region 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-11-15T14:44:47Z","abstract_excerpt":"In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting; block-Markov superposition coding; and backward decoding. The proof of converse reuses some of the existing outer bounds and includes new ones obtained using genie-aided models. Following the insight gained from the analysis of the LD-IC-NF, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05322","kind":"arxiv","version":3},"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":"1611.05322","created_at":"2026-05-18T00:15:37.947790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05322v3","created_at":"2026-05-18T00:15:37.947790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05322","created_at":"2026-05-18T00:15:37.947790+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCOINCFOJDN2","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCOINCFOJDN2IUSR","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCOINCFO","created_at":"2026-05-18T12:30:44.179134+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/SCOINCFOJDN2IUSR4L7AJTY635","json":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635.json","graph_json":"https://pith.science/api/pith-number/SCOINCFOJDN2IUSR4L7AJTY635/graph.json","events_json":"https://pith.science/api/pith-number/SCOINCFOJDN2IUSR4L7AJTY635/events.json","paper":"https://pith.science/paper/SCOINCFO"},"agent_actions":{"view_html":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635","download_json":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635.json","view_paper":"https://pith.science/paper/SCOINCFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05322&json=true","fetch_graph":"https://pith.science/api/pith-number/SCOINCFOJDN2IUSR4L7AJTY635/graph.json","fetch_events":"https://pith.science/api/pith-number/SCOINCFOJDN2IUSR4L7AJTY635/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/action/storage_attestation","attest_author":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/action/author_attestation","sign_citation":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/action/citation_signature","submit_replication":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/action/replication_record"}},"created_at":"2026-05-18T00:15:37.947790+00:00","updated_at":"2026-05-18T00:15:37.947790+00:00"}