human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "multi objective optimization for robust power efficient and secure full duplex wireless communication systems"):
  Abstract: In this paper, we investigate the power efficient resource allocation algorithm design for secure multiuser wireless communication systems employing a full-duplex (FD) base station (BS) for serving multiple half-duplex (HD) downlink (DL) and uplink (UL) users simultaneously. We propose a multi-objective optimization framework to study two conflicting yet desirable design objectives, i.e., total DL transmit power minimization and total UL transmit power minimization. To this end, the weighed Tchebycheff method is adopted to formulate the resource allocation algorithm design as a multi-objective optimization problem (MOOP). The considered MOOP takes into account the quality-of-service (QoS) requirements of all legitimate users for guaranteeing secure DL and UL transmission in the presence of potential eavesdroppers. Thereby, secure UL transmission is enabled by the FD BS and would not be possible with an HD BS. The imperfectness of the channel state information of the eavesdropping channels and the inter-user interference channels is incorporated for robust resource allocation algorithm design. Although the considered MOOP is non-convex, we solve it optimally by semidefinite programming (SDP) relaxation. Simulation results not only unveil the trade-off between the total DL transmit power and the total UL transmit power, but also confirm the robustness of the proposed algorithm against potential eavesdroppers.

Includes members:
  Member "linear precoding of data and artificial noise in secure massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "multi antenna relay aided wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy outage analysis of non orthogonal spectrum sharing for heterogeneous cellular networks")
  Member "resource allocation in full duplex communications for future wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis and optimization of cooperative full duplex d2d communication underlaying cellular networks")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "robust beamforming for secure communication in systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "on the spectral efficiency of full duplex small cell wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal centralized dynamic time division duplex")
  Member "multi objective optimization for power efficient full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings")
  Member "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)