{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C5RT6G6SXGX3LDRE5GYDCPYX3G","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":"7731f59c5fcc5b694652a6ef0b85b6c7ba9f764c81958002a9c3530375c27251","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T01:09:32Z","title_canon_sha256":"a116def9ceca09ecdc15433f47d678a8fd3dc4e63fcf542d667272130067fe7f"},"schema_version":"1.0","source":{"id":"1210.0271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0271","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0271v1","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0271","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"C5RT6G6SXGX3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C5RT6G6SXGX3LDRE","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C5RT6G6S","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:cbb9e5005e5cb8d7fa6d25f0dcf7efc14c8aade995642d2595b0b4575cedf0c7","target":"graph","created_at":"2026-05-18T03:13: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":"We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint source-channel random-coding argument, which is based on a combination of Wyner et al.'s \"Cascaded Slepian-Wolf Source Coding\" and Tuncel's \"Slepian-Wolf Coding over Broadcast Channels\". We prove a separation theorem for the special case of two nodes; that is, we show that a modular code architecture with separate source and channel coding functions is (asym","authors_text":"Gottfried Lechner, Lawrence Ong, Roy Timo, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T01:09:32Z","title":"Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0271","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:48e633fda50283e7676cbb5fdb12104a6d7e27f8dd2059d15b52ee2c476fc47c","target":"record","created_at":"2026-05-18T03:13: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":"7731f59c5fcc5b694652a6ef0b85b6c7ba9f764c81958002a9c3530375c27251","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T01:09:32Z","title_canon_sha256":"a116def9ceca09ecdc15433f47d678a8fd3dc4e63fcf542d667272130067fe7f"},"schema_version":"1.0","source":{"id":"1210.0271","kind":"arxiv","version":1}},"canonical_sha256":"17633f1bd2b9afb58e24e9b0313f17d9ad7e2c1f0b09fd348279c712971ba3c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17633f1bd2b9afb58e24e9b0313f17d9ad7e2c1f0b09fd348279c712971ba3c4","first_computed_at":"2026-05-18T03:13:10.764642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:10.764642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1G0uRkBSqF/DuMGKqtDU2rQ3JH8NRv0f3l9xuhOarotRsFGv1I1iCcGh6Baw9V2xLVPyVuCXEeXksGaSyJB3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:10.765355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48e633fda50283e7676cbb5fdb12104a6d7e27f8dd2059d15b52ee2c476fc47c","sha256:cbb9e5005e5cb8d7fa6d25f0dcf7efc14c8aade995642d2595b0b4575cedf0c7"],"state_sha256":"4ceb7e48715f7655c290aab36fad0b35744d8390026f0579240d545903f8d44e"}