{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DCLWXJG3C56NDENBKN5BSPASEA","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":"109fe4977c003fd662fbf30eae55b0e8c02b3260c053319dbd651d6ae0eeefa3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T08:48:23Z","title_canon_sha256":"1a5a9d551cced3999a735289c37e2baa5f54ef342fbefde9bd0f5e48e2eca771"},"schema_version":"1.0","source":{"id":"1208.2116","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2116","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2116v2","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2116","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"DCLWXJG3C56N","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DCLWXJG3C56NDENB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DCLWXJG3","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:081f47b65c1673356c9629d8895db45a415e8f8f4598b6248f6fd2e88b4452d8","target":"graph","created_at":"2026-05-18T03:43:52Z","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":"We consider a three-node half-duplex Gaussian relay network where two nodes (say $a$, $b$) want to communicate with each other and the third node acts as a relay for this twoway communication. Outer bounds and achievable rate regions for the possible rate pairs $(R_a, R_b)$ for two-way communication are investigated. The modes (transmit or receive) of the halfduplex nodes together specify the state of the network. A relaying protocol uses a specific sequence of states and a coding scheme for each state. In this paper, we first obtain an outer bound for the rate region of all achievable $(R_a,R","authors_text":"Andrew Thangaraj, Ishaque Ashar K., Prathyusha V., Srikrishna Bhashyam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T08:48:23Z","title":"Outer Bounds for the Capacity Region of a Gaussian Two-way Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2116","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:fa22e1289a0895b9e72cbf6b703f26b953bd49b5511210a37f57419286600a8e","target":"record","created_at":"2026-05-18T03:43:52Z","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":"109fe4977c003fd662fbf30eae55b0e8c02b3260c053319dbd651d6ae0eeefa3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T08:48:23Z","title_canon_sha256":"1a5a9d551cced3999a735289c37e2baa5f54ef342fbefde9bd0f5e48e2eca771"},"schema_version":"1.0","source":{"id":"1208.2116","kind":"arxiv","version":2}},"canonical_sha256":"18976ba4db177cd191a1537a193c12203b2e0889c0e7203bec2c54256fdb9d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18976ba4db177cd191a1537a193c12203b2e0889c0e7203bec2c54256fdb9d03","first_computed_at":"2026-05-18T03:43:52.022460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:52.022460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0GPFrH1pLT+NIaIrbsaqW/WKxsRpxAcj1J+ka/ZIRM7senlYpbqWc8jsj20QLtuh/VuYgQdcAK6wAG9ePpl4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:52.022971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2116","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa22e1289a0895b9e72cbf6b703f26b953bd49b5511210a37f57419286600a8e","sha256:081f47b65c1673356c9629d8895db45a415e8f8f4598b6248f6fd2e88b4452d8"],"state_sha256":"86de23ce942aa2eb65b6d5c0f843726e3c6a3165622ac3cf11defd5ff3f712fa"}