{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2CLIXKU6ICNV7FC6YLKWT5PN7V","short_pith_number":"pith:2CLIXKU6","schema_version":"1.0","canonical_sha256":"d0968baa9e409b5f945ec2d569f5edfd56f12fc865a213a19dfdfa83353819b2","source":{"kind":"arxiv","id":"1903.09586","version":1},"attestation_state":"computed","paper":{"title":"NOMA in the Uplink: Delay Analysis with Imperfect CSI and Finite-Length Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"James Gross, Mikael Skoglund, Sebastian Schiessl","submitted_at":"2019-03-22T16:24:31Z","abstract_excerpt":"We study whether using non-orthogonal multiple access (NOMA) in the uplink of a mobile network can improve the performance over orthogonal multiple access (OMA) when the system requires ultra-reliable low-latency communications (URLLC). To answer this question, we first consider an ideal system model with perfect channel state information (CSI) at the transmitter and long codewords, where we determine the optimal decoding orders when the decoder uses successive interference cancellation (SIC) and derive closed-form expressions for the optimal rate when joint decoding is used. While joint decod"},"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":"1903.09586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-22T16:24:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"805a344c76658caa5a80f4380f1cefd17b496183ecefbc2f0d82bf76a6bcf1c2","abstract_canon_sha256":"b032bb47996141a06480bd26fa9d15e1e15f0298ab0bd1081610b3974827716f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.215954Z","signature_b64":"oEEEQM0MhGTXyrHpyoVn7g2qORXuJRajZ1na0zdog/jMt3vNZ0d+Y3m6yQUKShwY0mDCDWQvIiesZHm8OY9hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0968baa9e409b5f945ec2d569f5edfd56f12fc865a213a19dfdfa83353819b2","last_reissued_at":"2026-05-17T23:50:39.215548Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.215548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NOMA in the Uplink: Delay Analysis with Imperfect CSI and Finite-Length Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"James Gross, Mikael Skoglund, Sebastian Schiessl","submitted_at":"2019-03-22T16:24:31Z","abstract_excerpt":"We study whether using non-orthogonal multiple access (NOMA) in the uplink of a mobile network can improve the performance over orthogonal multiple access (OMA) when the system requires ultra-reliable low-latency communications (URLLC). To answer this question, we first consider an ideal system model with perfect channel state information (CSI) at the transmitter and long codewords, where we determine the optimal decoding orders when the decoder uses successive interference cancellation (SIC) and derive closed-form expressions for the optimal rate when joint decoding is used. While joint decod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09586","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":"1903.09586","created_at":"2026-05-17T23:50:39.215607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09586v1","created_at":"2026-05-17T23:50:39.215607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09586","created_at":"2026-05-17T23:50:39.215607+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CLIXKU6ICNV","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CLIXKU6ICNV7FC6","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CLIXKU6","created_at":"2026-05-18T12:33:07.085635+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/2CLIXKU6ICNV7FC6YLKWT5PN7V","json":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V.json","graph_json":"https://pith.science/api/pith-number/2CLIXKU6ICNV7FC6YLKWT5PN7V/graph.json","events_json":"https://pith.science/api/pith-number/2CLIXKU6ICNV7FC6YLKWT5PN7V/events.json","paper":"https://pith.science/paper/2CLIXKU6"},"agent_actions":{"view_html":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V","download_json":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V.json","view_paper":"https://pith.science/paper/2CLIXKU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09586&json=true","fetch_graph":"https://pith.science/api/pith-number/2CLIXKU6ICNV7FC6YLKWT5PN7V/graph.json","fetch_events":"https://pith.science/api/pith-number/2CLIXKU6ICNV7FC6YLKWT5PN7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V/action/storage_attestation","attest_author":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V/action/author_attestation","sign_citation":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V/action/citation_signature","submit_replication":"https://pith.science/pith/2CLIXKU6ICNV7FC6YLKWT5PN7V/action/replication_record"}},"created_at":"2026-05-17T23:50:39.215607+00:00","updated_at":"2026-05-17T23:50:39.215607+00:00"}