{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QJRPDSNBETXNV3T5X4SFLLAX3D","short_pith_number":"pith:QJRPDSNB","schema_version":"1.0","canonical_sha256":"8262f1c9a124eedaee7dbf2455ac17d8edc1764bfe4d52b562bfa31dbab201f7","source":{"kind":"arxiv","id":"1806.09004","version":2},"attestation_state":"computed","paper":{"title":"An Analysis of Two-User Uplink Asynchronous Non-Orthogonal Multiple Access Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Biao He, Hamid Jafarkhani, Xun Zou","submitted_at":"2018-06-23T16:55:49Z","abstract_excerpt":"Recent studies have numerically demonstrated the possible advantages of the asynchronous non-orthogonal multiple access (ANOMA) over the conventional synchronous non-orthogonal multiple access (NOMA). The ANOMA makes use of the oversampling technique by intentionally introducing a timing mismatch between symbols of different users. Focusing on a two-user uplink system, for the first time, we analytically prove that the ANOMA with a sufficiently large frame length can always outperform the NOMA in terms of the sum throughput. To this end, we derive the expression for the sum throughput of the A"},"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":"1806.09004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-23T16:55:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3f4973f2984432e28ce5356571f0f047ff49de2f109287cbe12216640f9ae32","abstract_canon_sha256":"4a6b036a1a8e5bee2c5aa9894133dd03f5843a3162262a619b8a2e56b0261ce6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:06.535513Z","signature_b64":"ODAvAOij7dHfAQZcR7o2vP/G836zl3WahykP2WLKHMPPejaaPakYLne9XGsmLyihqgIZsA8SFZVMwts98wjKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8262f1c9a124eedaee7dbf2455ac17d8edc1764bfe4d52b562bfa31dbab201f7","last_reissued_at":"2026-05-17T23:53:06.534866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:06.534866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Analysis of Two-User Uplink Asynchronous Non-Orthogonal Multiple Access Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Biao He, Hamid Jafarkhani, Xun Zou","submitted_at":"2018-06-23T16:55:49Z","abstract_excerpt":"Recent studies have numerically demonstrated the possible advantages of the asynchronous non-orthogonal multiple access (ANOMA) over the conventional synchronous non-orthogonal multiple access (NOMA). The ANOMA makes use of the oversampling technique by intentionally introducing a timing mismatch between symbols of different users. Focusing on a two-user uplink system, for the first time, we analytically prove that the ANOMA with a sufficiently large frame length can always outperform the NOMA in terms of the sum throughput. To this end, we derive the expression for the sum throughput of the A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09004","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.09004","created_at":"2026-05-17T23:53:06.534952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09004v2","created_at":"2026-05-17T23:53:06.534952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09004","created_at":"2026-05-17T23:53:06.534952+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJRPDSNBETXN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJRPDSNBETXNV3T5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJRPDSNB","created_at":"2026-05-18T12:32:46.962924+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/QJRPDSNBETXNV3T5X4SFLLAX3D","json":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D.json","graph_json":"https://pith.science/api/pith-number/QJRPDSNBETXNV3T5X4SFLLAX3D/graph.json","events_json":"https://pith.science/api/pith-number/QJRPDSNBETXNV3T5X4SFLLAX3D/events.json","paper":"https://pith.science/paper/QJRPDSNB"},"agent_actions":{"view_html":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D","download_json":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D.json","view_paper":"https://pith.science/paper/QJRPDSNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09004&json=true","fetch_graph":"https://pith.science/api/pith-number/QJRPDSNBETXNV3T5X4SFLLAX3D/graph.json","fetch_events":"https://pith.science/api/pith-number/QJRPDSNBETXNV3T5X4SFLLAX3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D/action/storage_attestation","attest_author":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D/action/author_attestation","sign_citation":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D/action/citation_signature","submit_replication":"https://pith.science/pith/QJRPDSNBETXNV3T5X4SFLLAX3D/action/replication_record"}},"created_at":"2026-05-17T23:53:06.534952+00:00","updated_at":"2026-05-17T23:53:06.534952+00:00"}