{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WNVGP3C56JKSM27NADJID3BNLS","short_pith_number":"pith:WNVGP3C5","schema_version":"1.0","canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","source":{"kind":"arxiv","id":"1708.07855","version":1},"attestation_state":"computed","paper":{"title":"Robust Beamforming Techniques for Non-Orthogonal Multiple Access Systems with Bounded Channel Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Faezeh Alavi, Kanapathippillai Cumanan, Zhiguo Ding","submitted_at":"2017-08-25T18:23:03Z","abstract_excerpt":"In this letter, we propose a robust beamforming design for non-orthogonal multiple access (NOMA) based multiple-input single-output (MISO) downlink systems. In particular, the robust power minimization problem is studied with imperfect channel state information (CSI), where the beamformers are designed by incorporating norm-bounded channel uncertainties to provide the required quality of service at each user. This robust scheme is developed based on the worst-case performance optimization framework. In terms of beamforming vectors, the original robust design is not convex and therefore, the ro"},"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.07855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-25T18:23:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"925fc87f2a4f4eee8d00887e871eea2207c7969aa1c367495d7199fd37f03519","abstract_canon_sha256":"ede277406456358ee07e7bd3c05be56c8267dc4e6a2bf198bfd0b922f73287de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.873276Z","signature_b64":"5gUfIdXuxzFYyKhFi/UpbJPARDYKaRebmIXzZUYYxlXnowX+wm85JkDcgxmNbSNjD2Z9y0Yks+0XnlXT2TEZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","last_reissued_at":"2026-05-18T00:36:37.872533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.872533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Beamforming Techniques for Non-Orthogonal Multiple Access Systems with Bounded Channel Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Faezeh Alavi, Kanapathippillai Cumanan, Zhiguo Ding","submitted_at":"2017-08-25T18:23:03Z","abstract_excerpt":"In this letter, we propose a robust beamforming design for non-orthogonal multiple access (NOMA) based multiple-input single-output (MISO) downlink systems. In particular, the robust power minimization problem is studied with imperfect channel state information (CSI), where the beamformers are designed by incorporating norm-bounded channel uncertainties to provide the required quality of service at each user. This robust scheme is developed based on the worst-case performance optimization framework. In terms of beamforming vectors, the original robust design is not convex and therefore, the ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07855","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":"1708.07855","created_at":"2026-05-18T00:36:37.872657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07855v1","created_at":"2026-05-18T00:36:37.872657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07855","created_at":"2026-05-18T00:36:37.872657+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNVGP3C56JKS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNVGP3C56JKSM27N","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNVGP3C5","created_at":"2026-05-18T12:31:53.515858+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/WNVGP3C56JKSM27NADJID3BNLS","json":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS.json","graph_json":"https://pith.science/api/pith-number/WNVGP3C56JKSM27NADJID3BNLS/graph.json","events_json":"https://pith.science/api/pith-number/WNVGP3C56JKSM27NADJID3BNLS/events.json","paper":"https://pith.science/paper/WNVGP3C5"},"agent_actions":{"view_html":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS","download_json":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS.json","view_paper":"https://pith.science/paper/WNVGP3C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07855&json=true","fetch_graph":"https://pith.science/api/pith-number/WNVGP3C56JKSM27NADJID3BNLS/graph.json","fetch_events":"https://pith.science/api/pith-number/WNVGP3C56JKSM27NADJID3BNLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/action/storage_attestation","attest_author":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/action/author_attestation","sign_citation":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/action/citation_signature","submit_replication":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/action/replication_record"}},"created_at":"2026-05-18T00:36:37.872657+00:00","updated_at":"2026-05-18T00:36:37.872657+00:00"}