{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JTSGUMN27KPCZLUN4265N2P2CH","short_pith_number":"pith:JTSGUMN2","schema_version":"1.0","canonical_sha256":"4ce46a31bafa9e2cae8de6bdd6e9fa11df6033c69e3067f33304f01066156825","source":{"kind":"arxiv","id":"1902.09993","version":1},"attestation_state":"computed","paper":{"title":"Performance of Non-orthogonal Multiple Access under Finite Blocklength","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Endrit Dosit, Hirley Alves, Matti Latva-aho, Mohammad Shehab","submitted_at":"2019-02-26T15:16:15Z","abstract_excerpt":"In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of i"},"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":"1902.09993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T15:16:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b3bb76d2ae0b4c8a043c93b499452cc32185ae6f0c5c4f7371a34a3a259bc7c","abstract_canon_sha256":"9452f62cb62f50108593e4c0fc5377c352f903c7dd3010a26899c484e0d7895f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.079670Z","signature_b64":"a8JfiPorMJ+ErhWvbxfGLDKOFqhZGDM26qSTlwQ03v+T6Y7u98xm3d7f2YCJCXaU8Y96VrK3IN7HjZSy7Dv1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce46a31bafa9e2cae8de6bdd6e9fa11df6033c69e3067f33304f01066156825","last_reissued_at":"2026-05-17T23:51:21.078980Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.078980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance of Non-orthogonal Multiple Access under Finite Blocklength","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Endrit Dosit, Hirley Alves, Matti Latva-aho, Mohammad Shehab","submitted_at":"2019-02-26T15:16:15Z","abstract_excerpt":"In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09993","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":"1902.09993","created_at":"2026-05-17T23:51:21.079092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09993v1","created_at":"2026-05-17T23:51:21.079092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09993","created_at":"2026-05-17T23:51:21.079092+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTSGUMN27KPC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTSGUMN27KPCZLUN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTSGUMN2","created_at":"2026-05-18T12:33:21.387695+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/JTSGUMN27KPCZLUN4265N2P2CH","json":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH.json","graph_json":"https://pith.science/api/pith-number/JTSGUMN27KPCZLUN4265N2P2CH/graph.json","events_json":"https://pith.science/api/pith-number/JTSGUMN27KPCZLUN4265N2P2CH/events.json","paper":"https://pith.science/paper/JTSGUMN2"},"agent_actions":{"view_html":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH","download_json":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH.json","view_paper":"https://pith.science/paper/JTSGUMN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09993&json=true","fetch_graph":"https://pith.science/api/pith-number/JTSGUMN27KPCZLUN4265N2P2CH/graph.json","fetch_events":"https://pith.science/api/pith-number/JTSGUMN27KPCZLUN4265N2P2CH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH/action/storage_attestation","attest_author":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH/action/author_attestation","sign_citation":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH/action/citation_signature","submit_replication":"https://pith.science/pith/JTSGUMN27KPCZLUN4265N2P2CH/action/replication_record"}},"created_at":"2026-05-17T23:51:21.079092+00:00","updated_at":"2026-05-17T23:51:21.079092+00:00"}