{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LEKDUQCTO4JOQMIGAQKPTX3YJO","short_pith_number":"pith:LEKDUQCT","schema_version":"1.0","canonical_sha256":"59143a40537712e831060414f9df784b81f7ff390e58a1aa33e6003e0d72bf25","source":{"kind":"arxiv","id":"1902.05735","version":1},"attestation_state":"computed","paper":{"title":"Sum Rate Fairness Trade-off-based Resource Allocation Technique for MISO NOMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alister G. Burr, Haitham Al-Obiedollah, Jeyarajan Thiyagalingam, Kanapathippillai Cumanan, Octavia A. Dobre, Zhiguo Ding","submitted_at":"2019-02-15T09:31:44Z","abstract_excerpt":"In this paper, we propose a beamforming design that jointly considers two conflicting performance metrics, namely the sum rate and fairness, for a multiple-input single-output non-orthogonal multiple access system. Unlike the conventional rate-aware beamforming designs, the proposed approach has the flexibility to assign different weights to the objectives (i.e., sum rate and fairness) according to the network requirements and the channel conditions. In particular, the proposed design is first formulated as a multi-objective optimization problem, and subsequently mapped to a single objective o"},"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.05735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-15T09:31:44Z","cross_cats_sorted":[],"title_canon_sha256":"82ba6c9041c91885feb5e112b5489bf4a9e881bb22604525bc70eaef6db6325a","abstract_canon_sha256":"06be6f30528c449c04da2efd41e4300ba6b1b6907b62a0b3e8133e58dd54d431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.286282Z","signature_b64":"ITLgwgWmg0e87UPXvgYxIegVJ7uctNKAdy6GYxERBNE1QiyDRW8BzHDTwSiHy4KBdTlUQEZ5Gm16VG0PDWSeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59143a40537712e831060414f9df784b81f7ff390e58a1aa33e6003e0d72bf25","last_reissued_at":"2026-05-17T23:53:56.285665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.285665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum Rate Fairness Trade-off-based Resource Allocation Technique for MISO NOMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alister G. Burr, Haitham Al-Obiedollah, Jeyarajan Thiyagalingam, Kanapathippillai Cumanan, Octavia A. Dobre, Zhiguo Ding","submitted_at":"2019-02-15T09:31:44Z","abstract_excerpt":"In this paper, we propose a beamforming design that jointly considers two conflicting performance metrics, namely the sum rate and fairness, for a multiple-input single-output non-orthogonal multiple access system. Unlike the conventional rate-aware beamforming designs, the proposed approach has the flexibility to assign different weights to the objectives (i.e., sum rate and fairness) according to the network requirements and the channel conditions. In particular, the proposed design is first formulated as a multi-objective optimization problem, and subsequently mapped to a single objective o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05735","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.05735","created_at":"2026-05-17T23:53:56.285790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05735v1","created_at":"2026-05-17T23:53:56.285790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05735","created_at":"2026-05-17T23:53:56.285790+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEKDUQCTO4JO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEKDUQCTO4JOQMIG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEKDUQCT","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/LEKDUQCTO4JOQMIGAQKPTX3YJO","json":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO.json","graph_json":"https://pith.science/api/pith-number/LEKDUQCTO4JOQMIGAQKPTX3YJO/graph.json","events_json":"https://pith.science/api/pith-number/LEKDUQCTO4JOQMIGAQKPTX3YJO/events.json","paper":"https://pith.science/paper/LEKDUQCT"},"agent_actions":{"view_html":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO","download_json":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO.json","view_paper":"https://pith.science/paper/LEKDUQCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05735&json=true","fetch_graph":"https://pith.science/api/pith-number/LEKDUQCTO4JOQMIGAQKPTX3YJO/graph.json","fetch_events":"https://pith.science/api/pith-number/LEKDUQCTO4JOQMIGAQKPTX3YJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO/action/storage_attestation","attest_author":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO/action/author_attestation","sign_citation":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO/action/citation_signature","submit_replication":"https://pith.science/pith/LEKDUQCTO4JOQMIGAQKPTX3YJO/action/replication_record"}},"created_at":"2026-05-17T23:53:56.285790+00:00","updated_at":"2026-05-17T23:53:56.285790+00:00"}