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 "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"):
  Abstract: Consider a full-duplex (FD) bidirectional secure communication system, where two communication nodes, named Alice and Bob, simultaneously transmit and receive confidential information from each other, and an eavesdropper, named Eve, overhears the transmissions. Our goal is to maximize the sum secrecy rate (SSR) of the bidirectional transmissions by optimizing the transmit covariance matrices at Alice and Bob. To tackle this SSR maximization (SSRM) problem, we develop an alternating difference-of-concave (ADC) programming approach to alternately optimize the transmit covariance matrices at Alice and Bob. We show that the ADC iteration has a semiclosed form beamforming solution, and is guaranteed to converge to a stationary solution of the SSRM problem. Besides the SSRM design, this paper also deals with a robust SSRM transmit design under a  moment-based  random channel state information (CSI) model, where only some roughly estimated first- and second-order statistics of Eve's CSI are available, but the exact distribution or other high-order statistics is not known. This moment-based error model is different from the widely used bounded-sphere error model and the Gaussian random error model. Under the considered CSI error model, the robust SSRM is formulated as an outage probability-constrained SSRM problem. By leveraging the Lagrangian duality theory and difference-of-concave (DC) programming, a tractable safe solution to the robust SSRM problem is derived. The effectiveness and the robustness of the proposed designs are demonstrated through simulations.

Includes members:
  Member "transceiver design to maximize the weighted sum secrecy rate in full duplex swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fog assisted multi user swipt networks local computing or offloading")
  Member "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "multi objective optimization for robust power efficient and secure full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "improving physical layer secrecy using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "optimal and robust transmit designs for miso channel secrecy by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "noma an information theoretic perspective")

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)