{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SEI7TXRCA3UEFYBJGSW3NYEJY7","short_pith_number":"pith:SEI7TXRC","schema_version":"1.0","canonical_sha256":"9111f9de2206e842e02934adb6e089c7d38b944f2829110c32042e495bed0467","source":{"kind":"arxiv","id":"1709.05304","version":1},"attestation_state":"computed","paper":{"title":"A Two-Phase Power Allocation Scheme for CRNs Employing NOMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Animesh Yadav, Georgios I. Tsiropoulos, Ming Zeng, Mohamed H. Ahmed, Octavia A. Dobre","submitted_at":"2017-09-15T16:52:51Z","abstract_excerpt":"In this paper, we consider the power allocation (PA) problem in cognitive radio networks (CRNs) employing nonorthogonal multiple access (NOMA) technique. Specifically, we aim to maximize the number of admitted secondary users (SUs) and their throughput, without violating the interference tolerance threshold of the primary users (PUs). This problem is divided into a two-phase PA process: a) maximizing the number of admitted SUs; b) maximizing the minimum throughput among the admitted SUs. To address the first phase, we apply a sequential and iterative PA algorithm, which fully exploits the char"},"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":"1709.05304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-15T16:52:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2484af663b74077f00c2ba053bfed91b6f9fb1111a6f1359165eadf7e85164a","abstract_canon_sha256":"67633c4a7d2492db36c1401058d72438c27f70dbb3eacc61be02cd45ffcf3eb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.039857Z","signature_b64":"n0x4pqhaESOQVvVuuOLgR/OtazvmhqLCukXQVyYe6T6nYOlOTRpLmqdG6QO0mhFR22NnDrO3Fy7+KL8V4dgCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9111f9de2206e842e02934adb6e089c7d38b944f2829110c32042e495bed0467","last_reissued_at":"2026-05-18T00:35:06.039231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.039231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Two-Phase Power Allocation Scheme for CRNs Employing NOMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Animesh Yadav, Georgios I. Tsiropoulos, Ming Zeng, Mohamed H. Ahmed, Octavia A. Dobre","submitted_at":"2017-09-15T16:52:51Z","abstract_excerpt":"In this paper, we consider the power allocation (PA) problem in cognitive radio networks (CRNs) employing nonorthogonal multiple access (NOMA) technique. Specifically, we aim to maximize the number of admitted secondary users (SUs) and their throughput, without violating the interference tolerance threshold of the primary users (PUs). This problem is divided into a two-phase PA process: a) maximizing the number of admitted SUs; b) maximizing the minimum throughput among the admitted SUs. To address the first phase, we apply a sequential and iterative PA algorithm, which fully exploits the char"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05304","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":"1709.05304","created_at":"2026-05-18T00:35:06.039340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05304v1","created_at":"2026-05-18T00:35:06.039340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05304","created_at":"2026-05-18T00:35:06.039340+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEI7TXRCA3UE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEI7TXRCA3UEFYBJ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEI7TXRC","created_at":"2026-05-18T12:31:43.269735+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/SEI7TXRCA3UEFYBJGSW3NYEJY7","json":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7.json","graph_json":"https://pith.science/api/pith-number/SEI7TXRCA3UEFYBJGSW3NYEJY7/graph.json","events_json":"https://pith.science/api/pith-number/SEI7TXRCA3UEFYBJGSW3NYEJY7/events.json","paper":"https://pith.science/paper/SEI7TXRC"},"agent_actions":{"view_html":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7","download_json":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7.json","view_paper":"https://pith.science/paper/SEI7TXRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05304&json=true","fetch_graph":"https://pith.science/api/pith-number/SEI7TXRCA3UEFYBJGSW3NYEJY7/graph.json","fetch_events":"https://pith.science/api/pith-number/SEI7TXRCA3UEFYBJGSW3NYEJY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7/action/storage_attestation","attest_author":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7/action/author_attestation","sign_citation":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7/action/citation_signature","submit_replication":"https://pith.science/pith/SEI7TXRCA3UEFYBJGSW3NYEJY7/action/replication_record"}},"created_at":"2026-05-18T00:35:06.039340+00:00","updated_at":"2026-05-18T00:35:06.039340+00:00"}