{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JNXBMY3ATWDWUKH4SLM5OGXBK5","short_pith_number":"pith:JNXBMY3A","canonical_record":{"source":{"id":"1407.6600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-24T14:40:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"636e21521abc1c135c25f4157ac5ff524e0dbb2d1412e40ec661b23b98038822","abstract_canon_sha256":"bc94001ae8033ca19ef896d6f9f9262d336c5f5e30fef210cab7fbbf31fa1b1f"},"schema_version":"1.0"},"canonical_sha256":"4b6e1663609d876a28fc92d9d71ae157636ce5cfc6df080ade937a09f4b3f177","source":{"kind":"arxiv","id":"1407.6600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6600","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6600v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6600","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"JNXBMY3ATWDW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JNXBMY3ATWDWUKH4","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JNXBMY3A","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JNXBMY3ATWDWUKH4SLM5OGXBK5","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-24T14:40:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"636e21521abc1c135c25f4157ac5ff524e0dbb2d1412e40ec661b23b98038822","abstract_canon_sha256":"bc94001ae8033ca19ef896d6f9f9262d336c5f5e30fef210cab7fbbf31fa1b1f"},"schema_version":"1.0"},"canonical_sha256":"4b6e1663609d876a28fc92d9d71ae157636ce5cfc6df080ade937a09f4b3f177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.900485Z","signature_b64":"0wlJHJdyOfTawUIHF21WNM+Ns/P9cFxwoxdG3g1DMUk4gi/7u3pQkJEwkpY0Tk47+iP0ixmGWROCtK7EHC9gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6e1663609d876a28fc92d9d71ae157636ce5cfc6df080ade937a09f4b3f177","last_reissued_at":"2026-05-18T02:26:38.899965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.899965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6600","source_version":2,"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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAIGlj87UdKWON1xtpmfvPVBFS0+693gzcJ6l7245xf0mQX6GfZv7Fhe65lRDvsXARxkeEpwo+ezZaqSIOMXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:05:05.893540Z"},"content_sha256":"4235f418b243c60e377331abadabf2377172d238f472f3eb52f3ea27fda04db2","schema_version":"1.0","event_id":"sha256:4235f418b243c60e377331abadabf2377172d238f472f3eb52f3ea27fda04db2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JNXBMY3ATWDWUKH4SLM5OGXBK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Capacity and Capacity per Unit Cost of Gaussian Multiple Access Channel with Peak Power Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farshad Lahouti, Siavash Ghavami","submitted_at":"2014-07-24T14:40:27Z","abstract_excerpt":"This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify the corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have a symmetric antipodal input distribution for all values of noise variance. Next, we analytically derive and characterize an achievable rate region for the capacity in cases with small peak power constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6600","kind":"arxiv","version":2},"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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wF4laFGxd0XnV4hQhRH6Dn2ivy6NVLZ3rEgATvQjkxpUsdbK11JSSwBs7kivfrEpq7tvA0uA/N2xkZna8S+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:05:05.893896Z"},"content_sha256":"c76167ce0f5f0e6af9d3b120ba6f1061399338371d8d4963c14d642cd6cef715","schema_version":"1.0","event_id":"sha256:c76167ce0f5f0e6af9d3b120ba6f1061399338371d8d4963c14d642cd6cef715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/bundle.json","state_url":"https://pith.science/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/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-04T00:05:05Z","links":{"resolver":"https://pith.science/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5","bundle":"https://pith.science/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/bundle.json","state":"https://pith.science/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNXBMY3ATWDWUKH4SLM5OGXBK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JNXBMY3ATWDWUKH4SLM5OGXBK5","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":"bc94001ae8033ca19ef896d6f9f9262d336c5f5e30fef210cab7fbbf31fa1b1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-24T14:40:27Z","title_canon_sha256":"636e21521abc1c135c25f4157ac5ff524e0dbb2d1412e40ec661b23b98038822"},"schema_version":"1.0","source":{"id":"1407.6600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6600","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6600v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6600","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"JNXBMY3ATWDW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JNXBMY3ATWDWUKH4","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JNXBMY3A","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c76167ce0f5f0e6af9d3b120ba6f1061399338371d8d4963c14d642cd6cef715","target":"graph","created_at":"2026-05-18T02:26:38Z","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":"This paper investigates the capacity and capacity per unit cost of Gaussian multiple access-channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify the corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have a symmetric antipodal input distribution for all values of noise variance. Next, we analytically derive and characterize an achievable rate region for the capacity in cases with small peak power constra","authors_text":"Farshad Lahouti, Siavash Ghavami","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-24T14:40:27Z","title":"On Capacity and Capacity per Unit Cost of Gaussian Multiple Access Channel with Peak Power Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6600","kind":"arxiv","version":2},"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:4235f418b243c60e377331abadabf2377172d238f472f3eb52f3ea27fda04db2","target":"record","created_at":"2026-05-18T02:26:38Z","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":"bc94001ae8033ca19ef896d6f9f9262d336c5f5e30fef210cab7fbbf31fa1b1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-24T14:40:27Z","title_canon_sha256":"636e21521abc1c135c25f4157ac5ff524e0dbb2d1412e40ec661b23b98038822"},"schema_version":"1.0","source":{"id":"1407.6600","kind":"arxiv","version":2}},"canonical_sha256":"4b6e1663609d876a28fc92d9d71ae157636ce5cfc6df080ade937a09f4b3f177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6e1663609d876a28fc92d9d71ae157636ce5cfc6df080ade937a09f4b3f177","first_computed_at":"2026-05-18T02:26:38.899965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.899965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0wlJHJdyOfTawUIHF21WNM+Ns/P9cFxwoxdG3g1DMUk4gi/7u3pQkJEwkpY0Tk47+iP0ixmGWROCtK7EHC9gAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.900485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4235f418b243c60e377331abadabf2377172d238f472f3eb52f3ea27fda04db2","sha256:c76167ce0f5f0e6af9d3b120ba6f1061399338371d8d4963c14d642cd6cef715"],"state_sha256":"18d2ff20dd67d41ea6fdb5ca474658b6072ca4727a0e5bb8e78ebc7b8145edc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CerFSXeDlFDTT1G0toobXVnkCOx+hfA8FMWbmlFXZTsRCnQodEYZ2JtTmYuiq/08lIcnaNHPc0PVN4FjgPLRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:05:05.896356Z","bundle_sha256":"75237047f98ee0283fb3d2f9b555cc079edf7f19970f456dda4cdd99214e2fe7"}}