{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6DNMRLM2LXNICOJQI7OXEDPSV4","short_pith_number":"pith:6DNMRLM2","schema_version":"1.0","canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","source":{"kind":"arxiv","id":"1510.09046","version":2},"attestation_state":"computed","paper":{"title":"Three-Way Channels with Multiple Unicast Sessions: Capacity Approximation via Network Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anas Chaaban, Aydin Sezgin, Henning Maier, Rudolf Mathar","submitted_at":"2015-10-30T11:03:52Z","abstract_excerpt":"A network of 3 nodes mutually communicating with each other is studied. This multi-way network is a suitable model for 3-user device-to-device communications. The main goal of this paper is to characterize the capacity region of the underlying Gaussian 3-way channel (3WC) within a constant gap. To this end, a capacity outer bound is derived using cut-set bounds and genie-aided bounds. For achievability, the 3WC is first transformed into an equivalent star-channel. This latter is then decomposed into a set of `successive' sub-channels, leading to a sub-channel allocation problem. Using backward"},"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":"1510.09046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T11:03:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6abb0057d01d9df4c6e4b7b60774631780842793d18a2575802b45e524382c4d","abstract_canon_sha256":"67f7ad230684c7dccaedb1b0da3fd931c343d3f8f46ee89994b5dbda31295a20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.150987Z","signature_b64":"5yTepJUNyCNIUDMqMay9xh7M+iy64tykxBuHMui9ps6YugAEX2Nexpkd4uS8YYnYRJwcVj0QSPkfuU2cfVTUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","last_reissued_at":"2026-05-18T00:58:10.150261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.150261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-Way Channels with Multiple Unicast Sessions: Capacity Approximation via Network Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anas Chaaban, Aydin Sezgin, Henning Maier, Rudolf Mathar","submitted_at":"2015-10-30T11:03:52Z","abstract_excerpt":"A network of 3 nodes mutually communicating with each other is studied. This multi-way network is a suitable model for 3-user device-to-device communications. The main goal of this paper is to characterize the capacity region of the underlying Gaussian 3-way channel (3WC) within a constant gap. To this end, a capacity outer bound is derived using cut-set bounds and genie-aided bounds. For achievability, the 3WC is first transformed into an equivalent star-channel. This latter is then decomposed into a set of `successive' sub-channels, leading to a sub-channel allocation problem. Using backward"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09046","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":"1510.09046","created_at":"2026-05-18T00:58:10.150402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.09046v2","created_at":"2026-05-18T00:58:10.150402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09046","created_at":"2026-05-18T00:58:10.150402+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DNMRLM2LXNI","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DNMRLM2LXNICOJQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DNMRLM2","created_at":"2026-05-18T12:29:07.941421+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/6DNMRLM2LXNICOJQI7OXEDPSV4","json":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4.json","graph_json":"https://pith.science/api/pith-number/6DNMRLM2LXNICOJQI7OXEDPSV4/graph.json","events_json":"https://pith.science/api/pith-number/6DNMRLM2LXNICOJQI7OXEDPSV4/events.json","paper":"https://pith.science/paper/6DNMRLM2"},"agent_actions":{"view_html":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4","download_json":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4.json","view_paper":"https://pith.science/paper/6DNMRLM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.09046&json=true","fetch_graph":"https://pith.science/api/pith-number/6DNMRLM2LXNICOJQI7OXEDPSV4/graph.json","fetch_events":"https://pith.science/api/pith-number/6DNMRLM2LXNICOJQI7OXEDPSV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/action/storage_attestation","attest_author":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/action/author_attestation","sign_citation":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/action/citation_signature","submit_replication":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/action/replication_record"}},"created_at":"2026-05-18T00:58:10.150402+00:00","updated_at":"2026-05-18T00:58:10.150402+00:00"}