{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WNVGP3C56JKSM27NADJID3BNLS","short_pith_number":"pith:WNVGP3C5","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"},"canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","source":{"kind":"arxiv","id":"1708.07855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07855","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07855v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07855","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"WNVGP3C56JKS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WNVGP3C56JKSM27N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WNVGP3C5","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WNVGP3C56JKSM27NADJID3BNLS","target":"record","payload":{"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"},"canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","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"},"source_kind":"arxiv","source_id":"1708.07855","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJbkvJhzU77Cn4kwjOU2iKhpRtVWHomJgRfTcFHFt8a8VY/60x3QNI+7S1kFKwN9JnIqUcBK3wTMVH/o+ENtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:59.996831Z"},"content_sha256":"3a5974a7b26b858b0d15f20c134f41352c1be4f00d00b46e3d53f9dd0996e43b","schema_version":"1.0","event_id":"sha256:3a5974a7b26b858b0d15f20c134f41352c1be4f00d00b46e3d53f9dd0996e43b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WNVGP3C56JKSM27NADJID3BNLS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uaf+oR+dCBN5pr9VquvXUEpDNrdML00mutvxcoL61gCX/9qErooSqhpetcr/B34pDP6OEAfjFx9ncX2IHlUEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:59.997507Z"},"content_sha256":"ebfeceb5caad9b0dfffcb1281279cfafd66620fef248d66c41a6f945ba318849","schema_version":"1.0","event_id":"sha256:ebfeceb5caad9b0dfffcb1281279cfafd66620fef248d66c41a6f945ba318849"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/bundle.json","state_url":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNVGP3C56JKSM27NADJID3BNLS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T03:33:59Z","links":{"resolver":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS","bundle":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/bundle.json","state":"https://pith.science/pith/WNVGP3C56JKSM27NADJID3BNLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNVGP3C56JKSM27NADJID3BNLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WNVGP3C56JKSM27NADJID3BNLS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ede277406456358ee07e7bd3c05be56c8267dc4e6a2bf198bfd0b922f73287de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-25T18:23:03Z","title_canon_sha256":"925fc87f2a4f4eee8d00887e871eea2207c7969aa1c367495d7199fd37f03519"},"schema_version":"1.0","source":{"id":"1708.07855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07855","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07855v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07855","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"WNVGP3C56JKS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WNVGP3C56JKSM27N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WNVGP3C5","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:ebfeceb5caad9b0dfffcb1281279cfafd66620fef248d66c41a6f945ba318849","target":"graph","created_at":"2026-05-18T00:36:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alister G. Burr, Faezeh Alavi, Kanapathippillai Cumanan, Zhiguo Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-25T18:23:03Z","title":"Robust Beamforming Techniques for Non-Orthogonal Multiple Access Systems with Bounded Channel Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07855","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a5974a7b26b858b0d15f20c134f41352c1be4f00d00b46e3d53f9dd0996e43b","target":"record","created_at":"2026-05-18T00:36:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ede277406456358ee07e7bd3c05be56c8267dc4e6a2bf198bfd0b922f73287de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-25T18:23:03Z","title_canon_sha256":"925fc87f2a4f4eee8d00887e871eea2207c7969aa1c367495d7199fd37f03519"},"schema_version":"1.0","source":{"id":"1708.07855","kind":"arxiv","version":1}},"canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b36a67ec5df255266bed00d281ec2d5ca20ff95c4bca3ccc1bb469ab37af99a7","first_computed_at":"2026-05-18T00:36:37.872533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:37.872533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5gUfIdXuxzFYyKhFi/UpbJPARDYKaRebmIXzZUYYxlXnowX+wm85JkDcgxmNbSNjD2Z9y0Yks+0XnlXT2TEZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:37.873276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a5974a7b26b858b0d15f20c134f41352c1be4f00d00b46e3d53f9dd0996e43b","sha256:ebfeceb5caad9b0dfffcb1281279cfafd66620fef248d66c41a6f945ba318849"],"state_sha256":"1df9ebfd3d4b8dc17f923d8d25d9a57bc7ad4c3aea5b776475ec55e781c24c1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TQe5C2mU1ONxUekwNEGQuGzGa9mNU1B2MKedIXGbB+P1ZVphxwERNzQiKqBa7BShTj5wKkOtva2t22tCziqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:34:00.001084Z","bundle_sha256":"a3ce9db15666057f757a40f54977c65b6d7927c058aedcf3d2a9020ae241f2c3"}}