{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5W6ED5DGRMDJWH6YAHWKIILCPE","short_pith_number":"pith:5W6ED5DG","schema_version":"1.0","canonical_sha256":"edbc41f4668b069b1fd801eca421627925f2fd504b0c9946d5864d6eff59985c","source":{"kind":"arxiv","id":"1710.01391","version":1},"attestation_state":"computed","paper":{"title":"Robust and Secure Resource Allocation for Full-Duplex MISO Multicarrier NOMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Jun Zhu, Robert Schober, Yan Sun","submitted_at":"2017-10-03T21:17:27Z","abstract_excerpt":"In this paper, we study the resource allocation algorithm design for multiple-input single-output (MISO) multicarrier non-orthogonal multiple access (MC-NOMA) systems, in which a full-duplex base station serves multiple half-duplex uplink and downlink users on the same subcarrier simultaneously. The resource allocation is optimized for maximization of the weighted system throughput while the information leakage is constrained and artificial noise is injected to guarantee secure communication in the presence of multiple potential eavesdroppers. To this end, we formulate a robust non-convex opti"},"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":"1710.01391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-03T21:17:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a036891c1c6e11e9ef80d3af65040b3056cbb3f972ca3d702efcf00a4c3a390","abstract_canon_sha256":"5ce781c5e316214056cd6fb8a4bc9cc93d787d89a58842a6a84ae527be2b90a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.941211Z","signature_b64":"My9xUAmKaqGy4HhplMrl5fbPo7x4evIf/LG93SwOOS7xuER20n4D0AMigMJ06nEbOohhXhp936NO8mHzSroBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edbc41f4668b069b1fd801eca421627925f2fd504b0c9946d5864d6eff59985c","last_reissued_at":"2026-05-18T00:33:42.940721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.940721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Secure Resource Allocation for Full-Duplex MISO Multicarrier NOMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Jun Zhu, Robert Schober, Yan Sun","submitted_at":"2017-10-03T21:17:27Z","abstract_excerpt":"In this paper, we study the resource allocation algorithm design for multiple-input single-output (MISO) multicarrier non-orthogonal multiple access (MC-NOMA) systems, in which a full-duplex base station serves multiple half-duplex uplink and downlink users on the same subcarrier simultaneously. The resource allocation is optimized for maximization of the weighted system throughput while the information leakage is constrained and artificial noise is injected to guarantee secure communication in the presence of multiple potential eavesdroppers. To this end, we formulate a robust non-convex opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01391","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":"1710.01391","created_at":"2026-05-18T00:33:42.940790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01391v1","created_at":"2026-05-18T00:33:42.940790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01391","created_at":"2026-05-18T00:33:42.940790+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W6ED5DGRMDJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W6ED5DGRMDJWH6Y","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W6ED5DG","created_at":"2026-05-18T12:31:00.734936+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/5W6ED5DGRMDJWH6YAHWKIILCPE","json":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE.json","graph_json":"https://pith.science/api/pith-number/5W6ED5DGRMDJWH6YAHWKIILCPE/graph.json","events_json":"https://pith.science/api/pith-number/5W6ED5DGRMDJWH6YAHWKIILCPE/events.json","paper":"https://pith.science/paper/5W6ED5DG"},"agent_actions":{"view_html":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE","download_json":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE.json","view_paper":"https://pith.science/paper/5W6ED5DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01391&json=true","fetch_graph":"https://pith.science/api/pith-number/5W6ED5DGRMDJWH6YAHWKIILCPE/graph.json","fetch_events":"https://pith.science/api/pith-number/5W6ED5DGRMDJWH6YAHWKIILCPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE/action/storage_attestation","attest_author":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE/action/author_attestation","sign_citation":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE/action/citation_signature","submit_replication":"https://pith.science/pith/5W6ED5DGRMDJWH6YAHWKIILCPE/action/replication_record"}},"created_at":"2026-05-18T00:33:42.940790+00:00","updated_at":"2026-05-18T00:33:42.940790+00:00"}