{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KEFDGXHS744PIQAAHOYA5DXC5F","short_pith_number":"pith:KEFDGXHS","schema_version":"1.0","canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","source":{"kind":"arxiv","id":"1902.07862","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Asynchronous Non-Orthogonal Multiple Access with Power Minimization Under QoS Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Mehdi Ganji, Xun Zou","submitted_at":"2019-02-21T04:39:51Z","abstract_excerpt":"Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a timing mismatch is intentionally added in the broadcast signal. We derive the expressions for the individual throughputs of the strong user (acts as relay) which employs the block-wise successive interference cancellation (SIC) and the weak user which combines the symbol-asynchronous signal with the interfer"},"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.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bca9f5464fd588aaaf837a93b3d162cb81d435fd314591304120c806c20effc","abstract_canon_sha256":"99f189bfb53a8b00a85f750c6409b865a53dce0f44afa1c1c0a6d46525a6e5fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.653389Z","signature_b64":"RX38Rep2Z0vdF56I/NP4DoS+YXAGeFjNYkIWCBkPd44UVTPxVl4GV9FQl1VKiNQZg1tF+jvNZBf4XN8I0W7+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","last_reissued_at":"2026-05-17T23:53:03.652768Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.652768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Asynchronous Non-Orthogonal Multiple Access with Power Minimization Under QoS Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Mehdi Ganji, Xun Zou","submitted_at":"2019-02-21T04:39:51Z","abstract_excerpt":"Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a timing mismatch is intentionally added in the broadcast signal. We derive the expressions for the individual throughputs of the strong user (acts as relay) which employs the block-wise successive interference cancellation (SIC) and the weak user which combines the symbol-asynchronous signal with the interfer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07862","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.07862","created_at":"2026-05-17T23:53:03.652861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07862v1","created_at":"2026-05-17T23:53:03.652861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07862","created_at":"2026-05-17T23:53:03.652861+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEFDGXHS744P","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEFDGXHS744PIQAA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEFDGXHS","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/KEFDGXHS744PIQAAHOYA5DXC5F","json":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F.json","graph_json":"https://pith.science/api/pith-number/KEFDGXHS744PIQAAHOYA5DXC5F/graph.json","events_json":"https://pith.science/api/pith-number/KEFDGXHS744PIQAAHOYA5DXC5F/events.json","paper":"https://pith.science/paper/KEFDGXHS"},"agent_actions":{"view_html":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F","download_json":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F.json","view_paper":"https://pith.science/paper/KEFDGXHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07862&json=true","fetch_graph":"https://pith.science/api/pith-number/KEFDGXHS744PIQAAHOYA5DXC5F/graph.json","fetch_events":"https://pith.science/api/pith-number/KEFDGXHS744PIQAAHOYA5DXC5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/action/storage_attestation","attest_author":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/action/author_attestation","sign_citation":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/action/citation_signature","submit_replication":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/action/replication_record"}},"created_at":"2026-05-17T23:53:03.652861+00:00","updated_at":"2026-05-17T23:53:03.652861+00:00"}