{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3FYH74OTW5WGADO4YBXAI4UGP5","short_pith_number":"pith:3FYH74OT","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"},"canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","source":{"kind":"arxiv","id":"1605.09493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09493","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09493v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09493","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"3FYH74OTW5WG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3FYH74OTW5WGADO4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3FYH74OT","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3FYH74OTW5WGADO4YBXAI4UGP5","target":"record","payload":{"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"},"canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","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"},"source_kind":"arxiv","source_id":"1605.09493","source_version":1,"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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QBCFzGBwhye2xKc/lQg8IP8iR1KxcbAy+zaXvmjouHymFk7RtozJuNEBQBS6ZFh3cAhvmzgdVAC0ISooaA7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:00:01.967628Z"},"content_sha256":"f9a1b379ef7d22e556bfd8622db238440d75cb7059085c9eb5fb92692e725e21","schema_version":"1.0","event_id":"sha256:f9a1b379ef7d22e556bfd8622db238440d75cb7059085c9eb5fb92692e725e21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3FYH74OTW5WGADO4YBXAI4UGP5","target":"graph","payload":{"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"},"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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ix4bRjtMbA+vBQVnAiFnTxytERTF7WGlUF+dMzKYUWX9xySSaWTUrHK7WneumHW7skX/y9LXPZVYp+cYwCNCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:00:01.967971Z"},"content_sha256":"0cbd4d6d2078770515160c1800a4b1fe50045564bdc70f478968ac6bd4f2159c","schema_version":"1.0","event_id":"sha256:0cbd4d6d2078770515160c1800a4b1fe50045564bdc70f478968ac6bd4f2159c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/bundle.json","state_url":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FYH74OTW5WGADO4YBXAI4UGP5/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-06-23T04:00:01Z","links":{"resolver":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5","bundle":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/bundle.json","state":"https://pith.science/pith/3FYH74OTW5WGADO4YBXAI4UGP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FYH74OTW5WGADO4YBXAI4UGP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3FYH74OTW5WGADO4YBXAI4UGP5","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":"548a9276023defdb136822470baf1345dcae0db58ee8d25f3688b056bf4149ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-31T04:27:22Z","title_canon_sha256":"6d9d04cb3cc7f2f097deaef5fa5f8b33060aadfb822ebe65259c0f24660c7170"},"schema_version":"1.0","source":{"id":"1605.09493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09493","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09493v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09493","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"3FYH74OTW5WG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3FYH74OTW5WGADO4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3FYH74OT","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:0cbd4d6d2078770515160c1800a4b1fe50045564bdc70f478968ac6bd4f2159c","target":"graph","created_at":"2026-05-18T01: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 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","authors_text":"Lawrence Ong, Roy Timo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-31T04:27:22Z","title":"A Multiway Relay Channel with Balanced Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09493","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:f9a1b379ef7d22e556bfd8622db238440d75cb7059085c9eb5fb92692e725e21","target":"record","created_at":"2026-05-18T01: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":"548a9276023defdb136822470baf1345dcae0db58ee8d25f3688b056bf4149ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-31T04:27:22Z","title_canon_sha256":"6d9d04cb3cc7f2f097deaef5fa5f8b33060aadfb822ebe65259c0f24660c7170"},"schema_version":"1.0","source":{"id":"1605.09493","kind":"arxiv","version":1}},"canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9707ff1d3b76c600ddcc06e0472867f66e7eeb388964c9078a4d93c0e3ea0f0","first_computed_at":"2026-05-18T01:13:10.763779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:10.763779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xq69jp5EFfo/ycQWxayuKh2dezWnx4xgWJ3AynjmlkOIWCZq7C6amo+YmENVSVyrkMmrQlA0jsX1GdjdPbJ3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:10.764138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9a1b379ef7d22e556bfd8622db238440d75cb7059085c9eb5fb92692e725e21","sha256:0cbd4d6d2078770515160c1800a4b1fe50045564bdc70f478968ac6bd4f2159c"],"state_sha256":"89bf9a219f12c4d757bec2b28e7346f14155021b44b30079cb89cc3a463c860f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4W23Ry2VqcZs2ylZ/6r5IYtAOcpFtGg5KX+iXrmGwVgDZ0zO2HH20JLP7ikrpyLSPL1Pb04YDQIiCQ7os8kBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:00:01.969812Z","bundle_sha256":"613119b61e4f2b11fcade0569d073c63d48ba9f735c2d7f59f515bf33d1a6ca3"}}