{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A7Z7KKNS6B7FPGU3VHAG3IEK3X","short_pith_number":"pith:A7Z7KKNS","schema_version":"1.0","canonical_sha256":"07f3f529b2f07e579a9ba9c06da08addc436b617454f88bf96dfc15e9e093468","source":{"kind":"arxiv","id":"1708.01403","version":2},"attestation_state":"computed","paper":{"title":"Optimal Throughput Fairness Trade-offs for Downlink Non-Orthogonal Multiple Access over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Arumugam Nallanathan, Hong Xing, H. Vincent Poor, Yuanwei Liu, Zhiguo Ding","submitted_at":"2017-08-04T07:27:09Z","abstract_excerpt":"Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to successive decoding, judicious designs are required to guarantee user fairness. In this paper, a two-user downlink NOMA system over fading channels is considered. For delay-tolerant transmission, the average sum-rate is maximized subject to both average and peak power constraints as well as a minimum average user rate constraint. The optimal resource allocatio"},"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":"1708.01403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-04T07:27:09Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"80e053cea84b3315895ed1e70d83024be3b58ab472bb0d467e6583ab77f60d95","abstract_canon_sha256":"884dae5801a3ef876ef4989ec440956fa8decf4b40ea9a73d8ebb615c155123c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.285919Z","signature_b64":"4F4qVK4PU6LlQwCGgBmlGKZAEwI3v9clv8+fO2xNMOQqIxcOU9WuSqLVJH4OB/ifc7XqazG0o3RPqI32446CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f3f529b2f07e579a9ba9c06da08addc436b617454f88bf96dfc15e9e093468","last_reissued_at":"2026-05-18T00:22:49.285459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.285459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Throughput Fairness Trade-offs for Downlink Non-Orthogonal Multiple Access over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Arumugam Nallanathan, Hong Xing, H. Vincent Poor, Yuanwei Liu, Zhiguo Ding","submitted_at":"2017-08-04T07:27:09Z","abstract_excerpt":"Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to successive decoding, judicious designs are required to guarantee user fairness. In this paper, a two-user downlink NOMA system over fading channels is considered. For delay-tolerant transmission, the average sum-rate is maximized subject to both average and peak power constraints as well as a minimum average user rate constraint. The optimal resource allocatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01403","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":"1708.01403","created_at":"2026-05-18T00:22:49.285532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01403v2","created_at":"2026-05-18T00:22:49.285532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01403","created_at":"2026-05-18T00:22:49.285532+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7Z7KKNS6B7F","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7Z7KKNS6B7FPGU3","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7Z7KKNS","created_at":"2026-05-18T12:31:05.417338+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/A7Z7KKNS6B7FPGU3VHAG3IEK3X","json":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X.json","graph_json":"https://pith.science/api/pith-number/A7Z7KKNS6B7FPGU3VHAG3IEK3X/graph.json","events_json":"https://pith.science/api/pith-number/A7Z7KKNS6B7FPGU3VHAG3IEK3X/events.json","paper":"https://pith.science/paper/A7Z7KKNS"},"agent_actions":{"view_html":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X","download_json":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X.json","view_paper":"https://pith.science/paper/A7Z7KKNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01403&json=true","fetch_graph":"https://pith.science/api/pith-number/A7Z7KKNS6B7FPGU3VHAG3IEK3X/graph.json","fetch_events":"https://pith.science/api/pith-number/A7Z7KKNS6B7FPGU3VHAG3IEK3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X/action/storage_attestation","attest_author":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X/action/author_attestation","sign_citation":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X/action/citation_signature","submit_replication":"https://pith.science/pith/A7Z7KKNS6B7FPGU3VHAG3IEK3X/action/replication_record"}},"created_at":"2026-05-18T00:22:49.285532+00:00","updated_at":"2026-05-18T00:22:49.285532+00:00"}