{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DCLWXJG3C56NDENBKN5BSPASEA","short_pith_number":"pith:DCLWXJG3","schema_version":"1.0","canonical_sha256":"18976ba4db177cd191a1537a193c12203b2e0889c0e7203bec2c54256fdb9d03","source":{"kind":"arxiv","id":"1208.2116","version":2},"attestation_state":"computed","paper":{"title":"Outer Bounds for the Capacity Region of a Gaussian Two-way Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Ishaque Ashar K., Prathyusha V., Srikrishna Bhashyam","submitted_at":"2012-08-10T08:48:23Z","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"},"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":"1208.2116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T08:48:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a5a9d551cced3999a735289c37e2baa5f54ef342fbefde9bd0f5e48e2eca771","abstract_canon_sha256":"109fe4977c003fd662fbf30eae55b0e8c02b3260c053319dbd651d6ae0eeefa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:52.022971Z","signature_b64":"0GPFrH1pLT+NIaIrbsaqW/WKxsRpxAcj1J+ka/ZIRM7senlYpbqWc8jsj20QLtuh/VuYgQdcAK6wAG9ePpl4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18976ba4db177cd191a1537a193c12203b2e0889c0e7203bec2c54256fdb9d03","last_reissued_at":"2026-05-18T03:43:52.022460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:52.022460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outer Bounds for the Capacity Region of a Gaussian Two-way Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Ishaque Ashar K., Prathyusha V., Srikrishna Bhashyam","submitted_at":"2012-08-10T08:48:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2116","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.2116","created_at":"2026-05-18T03:43:52.022539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2116v2","created_at":"2026-05-18T03:43:52.022539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2116","created_at":"2026-05-18T03:43:52.022539+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCLWXJG3C56N","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCLWXJG3C56NDENB","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCLWXJG3","created_at":"2026-05-18T12:27:01.376967+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/DCLWXJG3C56NDENBKN5BSPASEA","json":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA.json","graph_json":"https://pith.science/api/pith-number/DCLWXJG3C56NDENBKN5BSPASEA/graph.json","events_json":"https://pith.science/api/pith-number/DCLWXJG3C56NDENBKN5BSPASEA/events.json","paper":"https://pith.science/paper/DCLWXJG3"},"agent_actions":{"view_html":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA","download_json":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA.json","view_paper":"https://pith.science/paper/DCLWXJG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2116&json=true","fetch_graph":"https://pith.science/api/pith-number/DCLWXJG3C56NDENBKN5BSPASEA/graph.json","fetch_events":"https://pith.science/api/pith-number/DCLWXJG3C56NDENBKN5BSPASEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA/action/storage_attestation","attest_author":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA/action/author_attestation","sign_citation":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA/action/citation_signature","submit_replication":"https://pith.science/pith/DCLWXJG3C56NDENBKN5BSPASEA/action/replication_record"}},"created_at":"2026-05-18T03:43:52.022539+00:00","updated_at":"2026-05-18T03:43:52.022539+00:00"}