{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YRA5LH2PIAIHRGTWNTHGRJ5FVX","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":"b6f2a4fd285dc4f424db94d8ca0c9555e759705cca6534bc1442367e5b2a7847","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-10T07:03:55Z","title_canon_sha256":"f3af781f065695dc2808d0142d82b31b00f6e73ad673ab1b076b19b256f019a1"},"schema_version":"1.0","source":{"id":"1106.1969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1969","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1969v1","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1969","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"YRA5LH2PIAIH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YRA5LH2PIAIHRGTW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YRA5LH2P","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:454aef45fe61dbbaf72c7f676e6e356842382d87d9b5d87a1c3a2e931c44eeed","target":"graph","created_at":"2026-05-18T04:20:13Z","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":"The multi-way relay channel is a multicast network where L users exchange data through a relay. In this paper, the capacity region of a class of multi-way relay channels is derived, where the channel inputs and outputs take values over finite fields. The cut-set upper bound to the capacity region is derived and is shown to be achievable by our proposed functional-decode-forward coding strategy. More specifically, for the general case where the users can transmit at possibly different rates, functional-decode-forward, combined with rate splitting and joint source-channel decoding, is proved to ","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-10T07:03:55Z","title":"The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1969","kind":"arxiv","version":1},"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:c0b3c8bbb8ba4c1d5610d067260ad4f5a8db9ad2fb31da523794bc5a5f668c07","target":"record","created_at":"2026-05-18T04:20:13Z","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":"b6f2a4fd285dc4f424db94d8ca0c9555e759705cca6534bc1442367e5b2a7847","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-10T07:03:55Z","title_canon_sha256":"f3af781f065695dc2808d0142d82b31b00f6e73ad673ab1b076b19b256f019a1"},"schema_version":"1.0","source":{"id":"1106.1969","kind":"arxiv","version":1}},"canonical_sha256":"c441d59f4f4010789a766cce68a7a5adee7f355e031a6209be9c9542d94c0ea9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c441d59f4f4010789a766cce68a7a5adee7f355e031a6209be9c9542d94c0ea9","first_computed_at":"2026-05-18T04:20:13.911587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:13.911587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPLWqKQZtJ93mFlA3jqZYF2MBIE4O1iSf/GIxM4zDNRUiSbpQiH3vQyAcqyKezXDXg5vi9wEKEJwTWchmfHdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:13.912242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0b3c8bbb8ba4c1d5610d067260ad4f5a8db9ad2fb31da523794bc5a5f668c07","sha256:454aef45fe61dbbaf72c7f676e6e356842382d87d9b5d87a1c3a2e931c44eeed"],"state_sha256":"e8c4a0782c3ff6ae3556922d21b212742243d9947925195952a18ce339916ed2"}