{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7CI5QMGTNGMBU4VT7PBJKMIWCQ","short_pith_number":"pith:7CI5QMGT","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"},"canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","source":{"kind":"arxiv","id":"1608.08907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08907","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08907v2","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08907","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"7CI5QMGTNGMB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7CI5QMGTNGMBU4VT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7CI5QMGT","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7CI5QMGTNGMBU4VT7PBJKMIWCQ","target":"record","payload":{"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"},"canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","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"},"source_kind":"arxiv","source_id":"1608.08907","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ir4b0RnFcMeegr0uB/QSCg3bvlU+vcoI0gXT9kH0Y5jq0ad6BuOrjdHno9+cw5mDDbL7sPx3U0g//CqO5sY7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:57.022410Z"},"content_sha256":"82574101204ff33157211d7fced4658158bd997914f8a30c64d162eb3f63b746","schema_version":"1.0","event_id":"sha256:82574101204ff33157211d7fced4658158bd997914f8a30c64d162eb3f63b746"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7CI5QMGTNGMBU4VT7PBJKMIWCQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/amBNC5mAWGxoLklZHukO1Qtl1ulpAmFS6xDeP7oQ0dja3bXVXiGcY/3qT1kqbQGU1puhcEZ4yjF9/aIszHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:35:57.023032Z"},"content_sha256":"9c1dd1c36f4635f40005f4c38b65ae20c5ea3be6d005bfa0639297cb7bddf6c4","schema_version":"1.0","event_id":"sha256:9c1dd1c36f4635f40005f4c38b65ae20c5ea3be6d005bfa0639297cb7bddf6c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/bundle.json","state_url":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T01:35:57Z","links":{"resolver":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ","bundle":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/bundle.json","state":"https://pith.science/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CI5QMGTNGMBU4VT7PBJKMIWCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7CI5QMGTNGMBU4VT7PBJKMIWCQ","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":"c61f737442d480b865abe1e01e6c6ed056771670847265d20c2b96461ae212d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-31T15:15:46Z","title_canon_sha256":"3849b6a0b37cbee5541da478b4d7231846e65104859fb612e3ac3b9a0d9cadee"},"schema_version":"1.0","source":{"id":"1608.08907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08907","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08907v2","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08907","created_at":"2026-05-18T00:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"7CI5QMGTNGMB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7CI5QMGTNGMBU4VT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7CI5QMGT","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:9c1dd1c36f4635f40005f4c38b65ae20c5ea3be6d005bfa0639297cb7bddf6c4","target":"graph","created_at":"2026-05-18T00:58:50Z","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"},"paper":{"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 ","authors_text":"I\\~naki Esnaola, Jean-Marie Gorce, Samir M. Perlaza, Victor Quintero","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-31T15:15:46Z","title":"Approximate Capacity of the Two-User Gaussian Interference Channel with Noisy Channel-Output Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08907","kind":"arxiv","version":2},"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:82574101204ff33157211d7fced4658158bd997914f8a30c64d162eb3f63b746","target":"record","created_at":"2026-05-18T00:58:50Z","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":"c61f737442d480b865abe1e01e6c6ed056771670847265d20c2b96461ae212d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-31T15:15:46Z","title_canon_sha256":"3849b6a0b37cbee5541da478b4d7231846e65104859fb612e3ac3b9a0d9cadee"},"schema_version":"1.0","source":{"id":"1608.08907","kind":"arxiv","version":2}},"canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f891d830d369981a72b3fbc29531161401d159c4313454f2a0ae253d51dafd79","first_computed_at":"2026-05-18T00:58:50.843378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:50.843378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMQfAlrTFViwSQlRNaFahPEB9CRI8gcxj3QkurAoddJS3x2CWX953LgtDQunMHXYVnpBGGrNCBd4lbfbbwDiBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:50.844084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82574101204ff33157211d7fced4658158bd997914f8a30c64d162eb3f63b746","sha256:9c1dd1c36f4635f40005f4c38b65ae20c5ea3be6d005bfa0639297cb7bddf6c4"],"state_sha256":"00bce76170afa52aa0ca5912e6351c1b4209a2e4c399f114167767b29a38552c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+cJbGPHhcYsFY64pXJBIZOGUTrH4RQWYEpT7SOssu6M4ygqo2K3mQbe2PSKZ5wgElczOBMgbRfsNw6AfP1VAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:35:57.027631Z","bundle_sha256":"cd0c1271e80400e912eebb8fd3864e3b1f8a581787b04ec004bf7e2cfc3d001e"}}