{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SCOINCFOJDN2IUSR4L7AJTY635","short_pith_number":"pith:SCOINCFO","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"},"canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","source":{"kind":"arxiv","id":"1611.05322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05322","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05322v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05322","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"SCOINCFOJDN2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SCOINCFOJDN2IUSR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SCOINCFO","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SCOINCFOJDN2IUSR4L7AJTY635","target":"record","payload":{"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"},"canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","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"},"source_kind":"arxiv","source_id":"1611.05322","source_version":3,"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aE+6DdqbtcnbdLFYo4zhWPH1h3eXRaX8D6Uo8iFr0RwRer1XFfzbJBASR/6MQ9Md3tRB79KTJppnuZUShUn0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:20:39.446946Z"},"content_sha256":"d4bc749ee1b0eb859d12252b6b043a104190c88d577d2bc7df939863c04faacf","schema_version":"1.0","event_id":"sha256:d4bc749ee1b0eb859d12252b6b043a104190c88d577d2bc7df939863c04faacf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SCOINCFOJDN2IUSR4L7AJTY635","target":"graph","payload":{"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"},"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7E100wOjTUxfP126rfbpFdW8Ai/+EEHBljBGPSv5uK4Gap7RXBm2dgPJjx2bi/BwR6+FurjQkdbjGZR8mW0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:20:39.447291Z"},"content_sha256":"36bcd79563e5da53bafda002ba1e608e1d6132d58a5a0b41aad2dd6e28bead9d","schema_version":"1.0","event_id":"sha256:36bcd79563e5da53bafda002ba1e608e1d6132d58a5a0b41aad2dd6e28bead9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/bundle.json","state_url":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCOINCFOJDN2IUSR4L7AJTY635/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-04T20:20:39Z","links":{"resolver":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635","bundle":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/bundle.json","state":"https://pith.science/pith/SCOINCFOJDN2IUSR4L7AJTY635/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCOINCFOJDN2IUSR4L7AJTY635/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SCOINCFOJDN2IUSR4L7AJTY635","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":"0b02b4c6339d4c314398d88419e820093163798d6ef33b674709cfe8c2d2b502","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:44:47Z","title_canon_sha256":"e46c6cf12cef986eef2c0b904a7242846533db3607f8d96651a371e1a05aa328"},"schema_version":"1.0","source":{"id":"1611.05322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05322","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05322v3","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05322","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"SCOINCFOJDN2","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SCOINCFOJDN2IUSR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SCOINCFO","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:36bcd79563e5da53bafda002ba1e608e1d6132d58a5a0b41aad2dd6e28bead9d","target":"graph","created_at":"2026-05-18T00:15:37Z","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 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","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-11-15T14:44:47Z","title":"Approximate Capacity Region 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":"1611.05322","kind":"arxiv","version":3},"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:d4bc749ee1b0eb859d12252b6b043a104190c88d577d2bc7df939863c04faacf","target":"record","created_at":"2026-05-18T00:15:37Z","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":"0b02b4c6339d4c314398d88419e820093163798d6ef33b674709cfe8c2d2b502","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:44:47Z","title_canon_sha256":"e46c6cf12cef986eef2c0b904a7242846533db3607f8d96651a371e1a05aa328"},"schema_version":"1.0","source":{"id":"1611.05322","kind":"arxiv","version":3}},"canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"909c8688ae48dba45251e2fe04cf1edf56554d3e343ec1a4f2837f089c12ebc4","first_computed_at":"2026-05-18T00:15:37.947710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.947710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/n3Pz1HTyH3oqt14eHhDaO3ZvKrYa0Xxks8uM7A4uPrg0Z9HNK4ZOZbXL5H/fv9s2QLy2uV9RQ2mWffDfrnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.948222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4bc749ee1b0eb859d12252b6b043a104190c88d577d2bc7df939863c04faacf","sha256:36bcd79563e5da53bafda002ba1e608e1d6132d58a5a0b41aad2dd6e28bead9d"],"state_sha256":"1a334446df6943816c57cb1032a11a06a92424697e02fb44ef0b438d75348355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovdgNZ6KMI+sCVBvfea7qJ7bFX2WSqcOIB0VlMM9lteoq7hLHeq/y6hJB41XKLzKqnOrjONwp2XQvBJXwfQbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:20:39.449377Z","bundle_sha256":"dc7b48a770e619558f62891b4cf58bb7eef0ed7406e533c828481613aa817a37"}}