{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZMMIDCMSAZB2CKG3YSFIFJFJJF","short_pith_number":"pith:ZMMIDCMS","canonical_record":{"source":{"id":"1701.07394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T17:36:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34502f99653e24d75d54288d9edb134e199cf60eb41e69b9dcb0a7bbc9e199ba","abstract_canon_sha256":"9549151eaa7c8dec4f487436e83df821cfd403ee592dea0b050b08ec4f1ab6b4"},"schema_version":"1.0"},"canonical_sha256":"cb188189920643a128dbc48a82a4a949567d6e4cccd33c6875acd324f677390c","source":{"kind":"arxiv","id":"1701.07394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07394","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07394v1","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07394","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZMMIDCMSAZB2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMMIDCMSAZB2CKG3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMMIDCMS","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZMMIDCMSAZB2CKG3YSFIFJFJJF","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T17:36:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34502f99653e24d75d54288d9edb134e199cf60eb41e69b9dcb0a7bbc9e199ba","abstract_canon_sha256":"9549151eaa7c8dec4f487436e83df821cfd403ee592dea0b050b08ec4f1ab6b4"},"schema_version":"1.0"},"canonical_sha256":"cb188189920643a128dbc48a82a4a949567d6e4cccd33c6875acd324f677390c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:04.663886Z","signature_b64":"afbTEsy6bsoC2RaVozjZIcooiaNXeORtq86nZ+1UoWALa5klh2kt9W0+lAPLpqBAje7WQXCAp1y61aEz1L48Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb188189920643a128dbc48a82a4a949567d6e4cccd33c6875acd324f677390c","last_reissued_at":"2026-05-18T00:52:04.663327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:04.663327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07394","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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF5oDh3Oj5ArivLwsmSJ4ykiVKHRbzQMMzoaD9rCAlmoJxaIWkEtO23Uc3uQOZL/rRogxzeTAZ1SNsvfAE6PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:34:53.979769Z"},"content_sha256":"d74b5e31e2bcd323d771cad5d9af6c5e8f0b2b2ea82cf6f7b607cec8bce723ed","schema_version":"1.0","event_id":"sha256:d74b5e31e2bcd323d771cad5d9af6c5e8f0b2b2ea82cf6f7b607cec8bce723ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZMMIDCMSAZB2CKG3YSFIFJFJJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Signal Shaping for Two-User Gaussian Multiple Access Channels with Computation: Beyond the Cut-Set Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Liu, Zhiyong Chen","submitted_at":"2017-01-25T17:36:34Z","abstract_excerpt":"In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per transmitter is beyond the cut-set bound. In contrast with the single-user discrete memoryless channel, the Maxwell-Boltzmann distribution is no longer a good approximation to the optimal input probability distribution for this discrete-time Gaussian MAC with computation. Specifically, we derive and analyze the mutual information for this channel. Because of the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07394","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-18T00:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91wrEBg0KOoqEZWhgsk5N+0FsVIXNRprdYuIpK6QfrsZoBf7pkIBQIAsecYUStrYuPy4EUC7Drg9tmgvEoaJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:34:53.980387Z"},"content_sha256":"c83b3642ecec37f8c3eec00770a375355ae248315e2b1d25014a4998427c5d2b","schema_version":"1.0","event_id":"sha256:c83b3642ecec37f8c3eec00770a375355ae248315e2b1d25014a4998427c5d2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/bundle.json","state_url":"https://pith.science/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/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-05-25T17:34:53Z","links":{"resolver":"https://pith.science/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF","bundle":"https://pith.science/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/bundle.json","state":"https://pith.science/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMMIDCMSAZB2CKG3YSFIFJFJJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZMMIDCMSAZB2CKG3YSFIFJFJJF","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":"9549151eaa7c8dec4f487436e83df821cfd403ee592dea0b050b08ec4f1ab6b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T17:36:34Z","title_canon_sha256":"34502f99653e24d75d54288d9edb134e199cf60eb41e69b9dcb0a7bbc9e199ba"},"schema_version":"1.0","source":{"id":"1701.07394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07394","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07394v1","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07394","created_at":"2026-05-18T00:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZMMIDCMSAZB2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMMIDCMSAZB2CKG3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMMIDCMS","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c83b3642ecec37f8c3eec00770a375355ae248315e2b1d25014a4998427c5d2b","target":"graph","created_at":"2026-05-18T00:52:04Z","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":"In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per transmitter is beyond the cut-set bound. In contrast with the single-user discrete memoryless channel, the Maxwell-Boltzmann distribution is no longer a good approximation to the optimal input probability distribution for this discrete-time Gaussian MAC with computation. Specifically, we derive and analyze the mutual information for this channel. Because of the co","authors_text":"Hui Liu, Zhiyong Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T17:36:34Z","title":"Signal Shaping for Two-User Gaussian Multiple Access Channels with Computation: Beyond the Cut-Set Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07394","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:d74b5e31e2bcd323d771cad5d9af6c5e8f0b2b2ea82cf6f7b607cec8bce723ed","target":"record","created_at":"2026-05-18T00:52:04Z","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":"9549151eaa7c8dec4f487436e83df821cfd403ee592dea0b050b08ec4f1ab6b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T17:36:34Z","title_canon_sha256":"34502f99653e24d75d54288d9edb134e199cf60eb41e69b9dcb0a7bbc9e199ba"},"schema_version":"1.0","source":{"id":"1701.07394","kind":"arxiv","version":1}},"canonical_sha256":"cb188189920643a128dbc48a82a4a949567d6e4cccd33c6875acd324f677390c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb188189920643a128dbc48a82a4a949567d6e4cccd33c6875acd324f677390c","first_computed_at":"2026-05-18T00:52:04.663327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:04.663327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afbTEsy6bsoC2RaVozjZIcooiaNXeORtq86nZ+1UoWALa5klh2kt9W0+lAPLpqBAje7WQXCAp1y61aEz1L48Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:04.663886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d74b5e31e2bcd323d771cad5d9af6c5e8f0b2b2ea82cf6f7b607cec8bce723ed","sha256:c83b3642ecec37f8c3eec00770a375355ae248315e2b1d25014a4998427c5d2b"],"state_sha256":"42fb9fb97b8f1c01ec4646dee0bfd348dadc6917d4ea67f183ea6a07aee00062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCP1zBBRnBcRb8co8c9oWCnSgvypkZbTCokQ8rFimJqU9xHfusJ1Sa7QZhQpSKJ2oGa9Evm6OxSQz5f590tzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:34:53.983988Z","bundle_sha256":"b55375cc94ab3aa2397c62f29e2be882d492d962ae96d757c28102b1e117d2d0"}}