{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6DNMRLM2LXNICOJQI7OXEDPSV4","short_pith_number":"pith:6DNMRLM2","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"},"canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","source":{"kind":"arxiv","id":"1510.09046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09046","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09046v2","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09046","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"6DNMRLM2LXNI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6DNMRLM2LXNICOJQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6DNMRLM2","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6DNMRLM2LXNICOJQI7OXEDPSV4","target":"record","payload":{"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"},"canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","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"},"source_kind":"arxiv","source_id":"1510.09046","source_version":2,"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:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKDwkGP8D3rSXHmt/8BmR9Uw7dI5+40rlZLEqJyN+yJ5Bm0KG856+Lc527dNRmN74TDyvj6bjFTtDO2JInmpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:53.760929Z"},"content_sha256":"2adc5cbe930c455741c5f296cdc2d52a2558c995dc0c07544e3227c198c5228f","schema_version":"1.0","event_id":"sha256:2adc5cbe930c455741c5f296cdc2d52a2558c995dc0c07544e3227c198c5228f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6DNMRLM2LXNICOJQI7OXEDPSV4","target":"graph","payload":{"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"},"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:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0SGs4b7aaJYWNlXEZsRfHqrh2k62k4oAWNrZNgJgzuN0080W/BUMzYWud/mbNLSnBH9eri+9I/CGV2C2FStCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:53.761646Z"},"content_sha256":"b1dbcba06faf970a9633ca9fa62ee4ee44d89a811f3fd99c90bdc16005c730c1","schema_version":"1.0","event_id":"sha256:b1dbcba06faf970a9633ca9fa62ee4ee44d89a811f3fd99c90bdc16005c730c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/bundle.json","state_url":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/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-05-25T18:57:53Z","links":{"resolver":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4","bundle":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/bundle.json","state":"https://pith.science/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DNMRLM2LXNICOJQI7OXEDPSV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6DNMRLM2LXNICOJQI7OXEDPSV4","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":"67f7ad230684c7dccaedb1b0da3fd931c343d3f8f46ee89994b5dbda31295a20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T11:03:52Z","title_canon_sha256":"6abb0057d01d9df4c6e4b7b60774631780842793d18a2575802b45e524382c4d"},"schema_version":"1.0","source":{"id":"1510.09046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09046","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09046v2","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09046","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"6DNMRLM2LXNI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6DNMRLM2LXNICOJQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6DNMRLM2","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:b1dbcba06faf970a9633ca9fa62ee4ee44d89a811f3fd99c90bdc16005c730c1","target":"graph","created_at":"2026-05-18T00:58:10Z","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":"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","authors_text":"Anas Chaaban, Aydin Sezgin, Henning Maier, Rudolf Mathar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T11:03:52Z","title":"Three-Way Channels with Multiple Unicast Sessions: Capacity Approximation via Network Transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09046","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:2adc5cbe930c455741c5f296cdc2d52a2558c995dc0c07544e3227c198c5228f","target":"record","created_at":"2026-05-18T00:58:10Z","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":"67f7ad230684c7dccaedb1b0da3fd931c343d3f8f46ee89994b5dbda31295a20","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-30T11:03:52Z","title_canon_sha256":"6abb0057d01d9df4c6e4b7b60774631780842793d18a2575802b45e524382c4d"},"schema_version":"1.0","source":{"id":"1510.09046","kind":"arxiv","version":2}},"canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0dac8ad9a5dda81393047dd720df2af326fa054f033bf380c05972c9e86d033","first_computed_at":"2026-05-18T00:58:10.150261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.150261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5yTepJUNyCNIUDMqMay9xh7M+iy64tykxBuHMui9ps6YugAEX2Nexpkd4uS8YYnYRJwcVj0QSPkfuU2cfVTUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.150987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2adc5cbe930c455741c5f296cdc2d52a2558c995dc0c07544e3227c198c5228f","sha256:b1dbcba06faf970a9633ca9fa62ee4ee44d89a811f3fd99c90bdc16005c730c1"],"state_sha256":"3a675fe25829345ad7f37bdf17c8a9edd246a98a5d3d21abd9979e85526df334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCnzr6R4CzSb/4ghkAx7h+ehpw0Jco63YGoxnyUeqUBKZ24yNVkElrH99J8IlGwdWczi56XRn0Cq9/17bAQMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:57:53.765927Z","bundle_sha256":"0d995a3c3545ada9a26c0b751b1aa3829083976a3ce9e1ac295da21a47d60630"}}