{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RDKEQTCDBPR2YWYFKJVVJF5TBR","short_pith_number":"pith:RDKEQTCD","schema_version":"1.0","canonical_sha256":"88d4484c430be3ac5b05526b5497b30c6665e2493e574c44ac3dc041abb5422d","source":{"kind":"arxiv","id":"1111.3395","version":1},"attestation_state":"computed","paper":{"title":"The Capacity of a Class of Multi-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","submitted_at":"2011-11-15T00:16:49Z","abstract_excerpt":"The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The cut-set upper bound to the capacity is shown to be achievable. More specifically, the capacity is achieved using (i) rate splitting, (ii) functional-decode-forward, and (iii) joint source-channel coding. We note that while separate source-channel coding can achieve the common-rate capacity, joint source-channel coding is used to achieve the capacity for the g"},"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":"1111.3395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-15T00:16:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ea41200091591328ca0c71b26184802557afb42550786d409d3fcebe3be941ee","abstract_canon_sha256":"ebdd8dd5fdc9244cf16b6b20eb98ca7475dbabad3203240cfede31088a6b2b07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:14.174440Z","signature_b64":"U5D6qZY5hKcmWvuuaAGngeGZIf4UmSnigKaNXLx3SLJUZfk8DYOFe6mOt/fqP8sY1XT8/PyhtetEBdcmp9LDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d4484c430be3ac5b05526b5497b30c6665e2493e574c44ac3dc041abb5422d","last_reissued_at":"2026-05-18T04:08:14.174002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:14.174002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of a Class of Multi-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","submitted_at":"2011-11-15T00:16:49Z","abstract_excerpt":"The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The cut-set upper bound to the capacity is shown to be achievable. More specifically, the capacity is achieved using (i) rate splitting, (ii) functional-decode-forward, and (iii) joint source-channel coding. We note that while separate source-channel coding can achieve the common-rate capacity, joint source-channel coding is used to achieve the capacity for the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3395","kind":"arxiv","version":1},"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":"1111.3395","created_at":"2026-05-18T04:08:14.174073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3395v1","created_at":"2026-05-18T04:08:14.174073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3395","created_at":"2026-05-18T04:08:14.174073+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDKEQTCDBPR2","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDKEQTCDBPR2YWYF","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDKEQTCD","created_at":"2026-05-18T12:26:41.206345+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/RDKEQTCDBPR2YWYFKJVVJF5TBR","json":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR.json","graph_json":"https://pith.science/api/pith-number/RDKEQTCDBPR2YWYFKJVVJF5TBR/graph.json","events_json":"https://pith.science/api/pith-number/RDKEQTCDBPR2YWYFKJVVJF5TBR/events.json","paper":"https://pith.science/paper/RDKEQTCD"},"agent_actions":{"view_html":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR","download_json":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR.json","view_paper":"https://pith.science/paper/RDKEQTCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3395&json=true","fetch_graph":"https://pith.science/api/pith-number/RDKEQTCDBPR2YWYFKJVVJF5TBR/graph.json","fetch_events":"https://pith.science/api/pith-number/RDKEQTCDBPR2YWYFKJVVJF5TBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR/action/storage_attestation","attest_author":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR/action/author_attestation","sign_citation":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR/action/citation_signature","submit_replication":"https://pith.science/pith/RDKEQTCDBPR2YWYFKJVVJF5TBR/action/replication_record"}},"created_at":"2026-05-18T04:08:14.174073+00:00","updated_at":"2026-05-18T04:08:14.174073+00:00"}