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 "robust beamforming and jamming for enhancing the physical layer security of full duplex radios"):
  Abstract: In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush–Kuhn–Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.

Includes members:
  Member "a new design paradigm for secure full duplex multiuser systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal user pairing for achieving rate fairness in downlink noma networks")
  Member "iterative distributed minimum total mse approach for secure communications in mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "detecting byzantine attacks without clean reference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detecting arbitrary attacks using continuous secured side information in wireless networks")
  Member "secrecy transmit beamforming for heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")
  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 "secure beamforming for mimo broadcasting with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust energy efficient beamforming in misome swipt systems with proportional secrecy rate")
  Member "security versus reliability analysis of opportunistic relaying":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio 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)