{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Y6W6NGV5TAA6JQ2DYID7Z54FBY","short_pith_number":"pith:Y6W6NGV5","schema_version":"1.0","canonical_sha256":"c7ade69abd9801e4c343c207fcf7850e1d7496936fad45f49ade5021cf50ff44","source":{"kind":"arxiv","id":"2104.01414","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning Powered IRS-Assisted Downlink NOMA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Bekir S. Ciftler, Daniele Trinchero, Mohamed Abdallah, Muhammad Shehab, Tamer Khattab","submitted_at":"2021-04-03T14:10:40Z","abstract_excerpt":"In this work, we examine an intelligent reflecting surface (IRS) assisted downlink non-orthogonal multiple access (NOMA) scenario with the aim of maximizing the sum rate of users. The optimization problem at the IRS is quite complicated, and non-convex, since it requires the tuning of the phase shift reflection matrix. Driven by the rising deployment of deep reinforcement learning (DRL) techniques that are capable of coping with solving non-convex optimization problems, we employ DRL to predict and optimally tune the IRS phase shift matrices. Simulation results reveal that IRS assisted NOMA ba"},"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":"2104.01414","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-04-03T14:10:40Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"7e6dc6b2eabe52090b2b7575243e2dcfbc6b6817375a86b2e951546e6f2eddc8","abstract_canon_sha256":"c35ad87905a4a74d52cfaa8fc1fe615e48b81b0f37b9b4e274ced846c0851f85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:59.802611Z","signature_b64":"PcE+4DbLhLBVMIkjrPaWlVbKw3lmjdvUyJp3ZRaHBixqJLQYsplVUfO0zyHTZbQkVmj0wqAxu6x4x+oXSOiOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7ade69abd9801e4c343c207fcf7850e1d7496936fad45f49ade5021cf50ff44","last_reissued_at":"2026-07-05T02:28:59.802172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:59.802172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning Powered IRS-Assisted Downlink NOMA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Bekir S. Ciftler, Daniele Trinchero, Mohamed Abdallah, Muhammad Shehab, Tamer Khattab","submitted_at":"2021-04-03T14:10:40Z","abstract_excerpt":"In this work, we examine an intelligent reflecting surface (IRS) assisted downlink non-orthogonal multiple access (NOMA) scenario with the aim of maximizing the sum rate of users. The optimization problem at the IRS is quite complicated, and non-convex, since it requires the tuning of the phase shift reflection matrix. Driven by the rising deployment of deep reinforcement learning (DRL) techniques that are capable of coping with solving non-convex optimization problems, we employ DRL to predict and optimally tune the IRS phase shift matrices. Simulation results reveal that IRS assisted NOMA ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.01414/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.01414","created_at":"2026-07-05T02:28:59.802233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01414v1","created_at":"2026-07-05T02:28:59.802233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01414","created_at":"2026-07-05T02:28:59.802233+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6W6NGV5TAA6","created_at":"2026-07-05T02:28:59.802233+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6W6NGV5TAA6JQ2D","created_at":"2026-07-05T02:28:59.802233+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6W6NGV5","created_at":"2026-07-05T02:28:59.802233+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/Y6W6NGV5TAA6JQ2DYID7Z54FBY","json":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY.json","graph_json":"https://pith.science/api/pith-number/Y6W6NGV5TAA6JQ2DYID7Z54FBY/graph.json","events_json":"https://pith.science/api/pith-number/Y6W6NGV5TAA6JQ2DYID7Z54FBY/events.json","paper":"https://pith.science/paper/Y6W6NGV5"},"agent_actions":{"view_html":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY","download_json":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY.json","view_paper":"https://pith.science/paper/Y6W6NGV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01414&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6W6NGV5TAA6JQ2DYID7Z54FBY/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6W6NGV5TAA6JQ2DYID7Z54FBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY/action/storage_attestation","attest_author":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY/action/author_attestation","sign_citation":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY/action/citation_signature","submit_replication":"https://pith.science/pith/Y6W6NGV5TAA6JQ2DYID7Z54FBY/action/replication_record"}},"created_at":"2026-07-05T02:28:59.802233+00:00","updated_at":"2026-07-05T02:28:59.802233+00:00"}