{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NGUQ7G2LT6N7AYIOAXLBK4UKBD","short_pith_number":"pith:NGUQ7G2L","schema_version":"1.0","canonical_sha256":"69a90f9b4b9f9bf0610e05d615728a08e02236e1dd1ad3bbe26a167e478adc2d","source":{"kind":"arxiv","id":"1904.11742","version":1},"attestation_state":"computed","paper":{"title":"Capacity per Unit-Energy of Gaussian Many-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jithin Ravi, Tobias Koch","submitted_at":"2019-04-26T09:49:21Z","abstract_excerpt":"We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength $n$. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the number of users is of an order strictly above $n/\\log n$, then the users cannot achieve any positive rate per unit-energy. In contrast, if the number of users is of order strictly below $n/\\log n$, then each user can achieve the single-user capacity per unit-energy $(\\log e)/N_0$ (where $N_0/ 2$ is the noise power) by using an orthogonal access scheme such as t"},"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":"1904.11742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-26T09:49:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a168ccc05e82b3a3291a532d771124cb2eb701eefe096853be88f0b78e13c78","abstract_canon_sha256":"652e8e33ccd1c31841bae9f8f9e3a02bd40789d5b4932748efc0d08368157bd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:41.050436Z","signature_b64":"hn+unFjur6ME2t295jYD6pQQgRlWA/a5OkngzCHKsAG9Z9KelPGmGaw1oZk17i8B94oO2C4+KqQq3nwy+6tDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a90f9b4b9f9bf0610e05d615728a08e02236e1dd1ad3bbe26a167e478adc2d","last_reissued_at":"2026-05-17T23:47:41.049763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:41.049763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity per Unit-Energy of Gaussian Many-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jithin Ravi, Tobias Koch","submitted_at":"2019-04-26T09:49:21Z","abstract_excerpt":"We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength $n$. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the number of users is of an order strictly above $n/\\log n$, then the users cannot achieve any positive rate per unit-energy. In contrast, if the number of users is of order strictly below $n/\\log n$, then each user can achieve the single-user capacity per unit-energy $(\\log e)/N_0$ (where $N_0/ 2$ is the noise power) by using an orthogonal access scheme such as t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11742","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":"1904.11742","created_at":"2026-05-17T23:47:41.049869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11742v1","created_at":"2026-05-17T23:47:41.049869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11742","created_at":"2026-05-17T23:47:41.049869+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGUQ7G2LT6N7","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGUQ7G2LT6N7AYIO","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGUQ7G2L","created_at":"2026-05-18T12:33:24.271573+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/NGUQ7G2LT6N7AYIOAXLBK4UKBD","json":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD.json","graph_json":"https://pith.science/api/pith-number/NGUQ7G2LT6N7AYIOAXLBK4UKBD/graph.json","events_json":"https://pith.science/api/pith-number/NGUQ7G2LT6N7AYIOAXLBK4UKBD/events.json","paper":"https://pith.science/paper/NGUQ7G2L"},"agent_actions":{"view_html":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD","download_json":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD.json","view_paper":"https://pith.science/paper/NGUQ7G2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11742&json=true","fetch_graph":"https://pith.science/api/pith-number/NGUQ7G2LT6N7AYIOAXLBK4UKBD/graph.json","fetch_events":"https://pith.science/api/pith-number/NGUQ7G2LT6N7AYIOAXLBK4UKBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD/action/storage_attestation","attest_author":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD/action/author_attestation","sign_citation":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD/action/citation_signature","submit_replication":"https://pith.science/pith/NGUQ7G2LT6N7AYIOAXLBK4UKBD/action/replication_record"}},"created_at":"2026-05-17T23:47:41.049869+00:00","updated_at":"2026-05-17T23:47:41.049869+00:00"}