{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GVBLTJXP7HWOLR4E45WXSYDSYF","short_pith_number":"pith:GVBLTJXP","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"},"canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","source":{"kind":"arxiv","id":"1704.04641","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04641","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04641v3","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04641","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"GVBLTJXP7HWO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVBLTJXP7HWOLR4E","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVBLTJXP","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GVBLTJXP7HWOLR4E45WXSYDSYF","target":"record","payload":{"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"},"canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","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"},"source_kind":"arxiv","source_id":"1704.04641","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovnYjcDzfjzdc2y4sC1iT2w1EQH00v2G4NVPwlx1iyRAH9qZs5E4JDrPrEn5Q3sNvq0fLrWBrGfsStPzYe1LDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:35:04.695919Z"},"content_sha256":"bc0f531caa2759865bf268e7d898c274a6383338f21b987dc76f25147939bf0c","schema_version":"1.0","event_id":"sha256:bc0f531caa2759865bf268e7d898c274a6383338f21b987dc76f25147939bf0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GVBLTJXP7HWOLR4E45WXSYDSYF","target":"graph","payload":{"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"},"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsGtZgNrng1XkKcCSbYcmgHg4I65s+1y9I5dNy9cjGcbhYbRq9sNeCe4hzPsdsHQUGawiXzCf9n5r5V5PFJ2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:35:04.696592Z"},"content_sha256":"33e3bcaa7bb43d06daccd4a38781d6a9022b6fda62b9dc9f9d73f45951be6b69","schema_version":"1.0","event_id":"sha256:33e3bcaa7bb43d06daccd4a38781d6a9022b6fda62b9dc9f9d73f45951be6b69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/bundle.json","state_url":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/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-07T06:35:04Z","links":{"resolver":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF","bundle":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/bundle.json","state":"https://pith.science/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVBLTJXP7HWOLR4E45WXSYDSYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GVBLTJXP7HWOLR4E45WXSYDSYF","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":"1376f827fb293e9fd80a74b15d0b58840846efaadfe44ae36848e1b17e9e841a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T14:40:00Z","title_canon_sha256":"6294d6ac2f42d1ce226abb51a3e1fe49ca482ee3c7b7351ed4ad71e9916cdb86"},"schema_version":"1.0","source":{"id":"1704.04641","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04641","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04641v3","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04641","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"GVBLTJXP7HWO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVBLTJXP7HWOLR4E","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVBLTJXP","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:33e3bcaa7bb43d06daccd4a38781d6a9022b6fda62b9dc9f9d73f45951be6b69","target":"graph","created_at":"2026-05-18T00:14:34Z","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":"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","authors_text":"Haiyang Xin, Soung-Chang Liew, Xiaojun Yuan, Yong Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T14:40:00Z","title":"Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within 1/2 Bit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04641","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:bc0f531caa2759865bf268e7d898c274a6383338f21b987dc76f25147939bf0c","target":"record","created_at":"2026-05-18T00:14:34Z","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":"1376f827fb293e9fd80a74b15d0b58840846efaadfe44ae36848e1b17e9e841a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-15T14:40:00Z","title_canon_sha256":"6294d6ac2f42d1ce226abb51a3e1fe49ca482ee3c7b7351ed4ad71e9916cdb86"},"schema_version":"1.0","source":{"id":"1704.04641","kind":"arxiv","version":3}},"canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3542b9a6eff9ece5c784e76d796072c15d1069a3bb241c3492e5771d2405756b","first_computed_at":"2026-05-18T00:14:34.650940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:34.650940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ghmxZfuYZWspJkhW/pyr70KVJtcREGfJmvyjFrgC4Rq0apWZoprMLPX3uy/kBOgSCd+j2Gjf8Q2pn7Uca2zDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:34.651485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04641","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc0f531caa2759865bf268e7d898c274a6383338f21b987dc76f25147939bf0c","sha256:33e3bcaa7bb43d06daccd4a38781d6a9022b6fda62b9dc9f9d73f45951be6b69"],"state_sha256":"b4db72992ff04e83c3f6bea9fba9601737e0b25c776dad345b1d651808622c88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8/+jEta/Kcp+7ttOVPqw8+O+nCXWbV9c3Luicuk8cuEBPGoivlaq6cXZcrH3aOqLtJGwirD15LqPHm7otM0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:35:04.700181Z","bundle_sha256":"f9a820e26df3cded69e27cb6116237928037522c5013a185839b79915a040608"}}