{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3FYH74OTW5WGADO4YBXAI4UGP5","short_pith_number":"pith:3FYH74OT","schema_version":"1.0","canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","source":{"kind":"arxiv","id":"1605.09493","version":1},"attestation_state":"computed","paper":{"title":"A Multiway Relay Channel with Balanced Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Roy Timo","submitted_at":"2016-05-31T04:27:22Z","abstract_excerpt":"We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a certain class $\\mathcal{P}^*$, and we demonstrate that strict source-channel separation is optimal within this class. We show how to test whether a given source belongs to $\\mathcal{P}^*$, we give a balanced-information regularity condition for $\\mathcal{P}^*$, and we express $\\mathcal{P}^*$ in terms of conditional multiple-mutual informations. Fi"},"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":"1605.09493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-31T04:27:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d9d04cb3cc7f2f097deaef5fa5f8b33060aadfb822ebe65259c0f24660c7170","abstract_canon_sha256":"548a9276023defdb136822470baf1345dcae0db58ee8d25f3688b056bf4149ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.764138Z","signature_b64":"Xq69jp5EFfo/ycQWxayuKh2dezWnx4xgWJ3AynjmlkOIWCZq7C6amo+YmENVSVyrkMmrQlA0jsX1GdjdPbJ3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","last_reissued_at":"2026-05-18T01:13:10.763779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.763779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multiway Relay Channel with Balanced Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Roy Timo","submitted_at":"2016-05-31T04:27:22Z","abstract_excerpt":"We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a certain class $\\mathcal{P}^*$, and we demonstrate that strict source-channel separation is optimal within this class. We show how to test whether a given source belongs to $\\mathcal{P}^*$, we give a balanced-information regularity condition for $\\mathcal{P}^*$, and we express $\\mathcal{P}^*$ in terms of conditional multiple-mutual informations. Fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09493","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":"1605.09493","created_at":"2026-05-18T01:13:10.763840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09493v1","created_at":"2026-05-18T01:13:10.763840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09493","created_at":"2026-05-18T01:13:10.763840+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FYH74OTW5WG","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FYH74OTW5WGADO4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FYH74OT","created_at":"2026-05-18T12:29:55.572404+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/3FYH74OTW5WGADO4YBXAI4UGP5","json":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5.json","graph_json":"https://pith.science/api/pith-number/3FYH74OTW5WGADO4YBXAI4UGP5/graph.json","events_json":"https://pith.science/api/pith-number/3FYH74OTW5WGADO4YBXAI4UGP5/events.json","paper":"https://pith.science/paper/3FYH74OT"},"agent_actions":{"view_html":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5","download_json":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5.json","view_paper":"https://pith.science/paper/3FYH74OT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09493&json=true","fetch_graph":"https://pith.science/api/pith-number/3FYH74OTW5WGADO4YBXAI4UGP5/graph.json","fetch_events":"https://pith.science/api/pith-number/3FYH74OTW5WGADO4YBXAI4UGP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/action/storage_attestation","attest_author":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/action/author_attestation","sign_citation":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/action/citation_signature","submit_replication":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/action/replication_record"}},"created_at":"2026-05-18T01:13:10.763840+00:00","updated_at":"2026-05-18T01:13:10.763840+00:00"}