{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GSN5WVBKLRAKFT5ZKE2DCSSYUV","short_pith_number":"pith:GSN5WVBK","schema_version":"1.0","canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","source":{"kind":"arxiv","id":"1501.01957","version":3},"attestation_state":"computed","paper":{"title":"Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Rahul Devassy, Tome Eftimov, Wei Yang, Zoran Utkovski","submitted_at":"2015-01-08T20:59:48Z","abstract_excerpt":"We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario, where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This sugge"},"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":"1501.01957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b77850421c2df46447519cc4c823b7a53aac509efc0b5bfb89bca82a8ff9e3b","abstract_canon_sha256":"d352771b960f6c07b58ff604bba6b52f4a99574c717ed4f5d4b1d0109f8dfd2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.111006Z","signature_b64":"3gVNezm0SUbnAyYJx4+3BWvv09An+MIXLuacWHXXr6xpULgAhDsa93zJSxl7eKXSJvR31MF7SE58cJ6dClwuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","last_reissued_at":"2026-05-18T00:58:11.110429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.110429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Rahul Devassy, Tome Eftimov, Wei Yang, Zoran Utkovski","submitted_at":"2015-01-08T20:59:48Z","abstract_excerpt":"We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario, where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This sugge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01957","kind":"arxiv","version":3},"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":"1501.01957","created_at":"2026-05-18T00:58:11.110509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01957v3","created_at":"2026-05-18T00:58:11.110509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01957","created_at":"2026-05-18T00:58:11.110509+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSN5WVBKLRAK","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSN5WVBKLRAKFT5Z","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSN5WVBK","created_at":"2026-05-18T12:29:22.688609+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/GSN5WVBKLRAKFT5ZKE2DCSSYUV","json":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV.json","graph_json":"https://pith.science/api/pith-number/GSN5WVBKLRAKFT5ZKE2DCSSYUV/graph.json","events_json":"https://pith.science/api/pith-number/GSN5WVBKLRAKFT5ZKE2DCSSYUV/events.json","paper":"https://pith.science/paper/GSN5WVBK"},"agent_actions":{"view_html":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV","download_json":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV.json","view_paper":"https://pith.science/paper/GSN5WVBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01957&json=true","fetch_graph":"https://pith.science/api/pith-number/GSN5WVBKLRAKFT5ZKE2DCSSYUV/graph.json","fetch_events":"https://pith.science/api/pith-number/GSN5WVBKLRAKFT5ZKE2DCSSYUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/action/storage_attestation","attest_author":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/action/author_attestation","sign_citation":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/action/citation_signature","submit_replication":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/action/replication_record"}},"created_at":"2026-05-18T00:58:11.110509+00:00","updated_at":"2026-05-18T00:58:11.110509+00:00"}