{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GVBLTJXP7HWOLR4E45WXSYDSYF","short_pith_number":"pith:GVBLTJXP","schema_version":"1.0","canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","source":{"kind":"arxiv","id":"1704.04641","version":3},"attestation_state":"computed","paper":{"title":"Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within 1/2 Bit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyang Xin, Soung-Chang Liew, Xiaojun Yuan, Yong Li","submitted_at":"2017-04-15T14:40:00Z","abstract_excerpt":"This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity of the Gaussian two-pair TWRC is achievable to within 1/2 bit for arbitrary channel conditions. In the proof, we develop a hybrid coding scheme involving Gaussian random coding, nested lattice coding, superposition coding, and network-coded decoding. Further, we present a message-reassembling strategy to decouple the coding design for the user-to-relay and re"},"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":"1704.04641","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T14:40:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6294d6ac2f42d1ce226abb51a3e1fe49ca482ee3c7b7351ed4ad71e9916cdb86","abstract_canon_sha256":"1376f827fb293e9fd80a74b15d0b58840846efaadfe44ae36848e1b17e9e841a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.651485Z","signature_b64":"ghmxZfuYZWspJkhW/pyr70KVJtcREGfJmvyjFrgC4Rq0apWZoprMLPX3uy/kBOgSCd+j2Gjf8Q2pn7Uca2zDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","last_reissued_at":"2026-05-18T00:14:34.650940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.650940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within 1/2 Bit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyang Xin, Soung-Chang Liew, Xiaojun Yuan, Yong Li","submitted_at":"2017-04-15T14:40:00Z","abstract_excerpt":"This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity of the Gaussian two-pair TWRC is achievable to within 1/2 bit for arbitrary channel conditions. In the proof, we develop a hybrid coding scheme involving Gaussian random coding, nested lattice coding, superposition coding, and network-coded decoding. Further, we present a message-reassembling strategy to decouple the coding design for the user-to-relay and re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04641","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":"1704.04641","created_at":"2026-05-18T00:14:34.651011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04641v3","created_at":"2026-05-18T00:14:34.651011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04641","created_at":"2026-05-18T00:14:34.651011+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVBLTJXP7HWO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVBLTJXP7HWOLR4E","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVBLTJXP","created_at":"2026-05-18T12:31:18.294218+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/GVBLTJXP7HWOLR4E45WXSYDSYF","json":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF.json","graph_json":"https://pith.science/api/pith-number/GVBLTJXP7HWOLR4E45WXSYDSYF/graph.json","events_json":"https://pith.science/api/pith-number/GVBLTJXP7HWOLR4E45WXSYDSYF/events.json","paper":"https://pith.science/paper/GVBLTJXP"},"agent_actions":{"view_html":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF","download_json":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF.json","view_paper":"https://pith.science/paper/GVBLTJXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04641&json=true","fetch_graph":"https://pith.science/api/pith-number/GVBLTJXP7HWOLR4E45WXSYDSYF/graph.json","fetch_events":"https://pith.science/api/pith-number/GVBLTJXP7HWOLR4E45WXSYDSYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/action/storage_attestation","attest_author":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/action/author_attestation","sign_citation":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/action/citation_signature","submit_replication":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/action/replication_record"}},"created_at":"2026-05-18T00:14:34.651011+00:00","updated_at":"2026-05-18T00:14:34.651011+00:00"}