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 "sum secrecy rate maximization in a multi carrier mimo wiretap channel with full duplex jamming"):
  Abstract: In this paper we address a worst-case weighted sum rate maximization problem for a full-duplex (FD) and point-to-point (P2P) system. The effects of channel-state information (CSI) error, as well as the signal distortion due to hardware impairments are jointly taken into account. Due to the intractable structure of the resulting problem, a weighted minimum mean squared error (WMMSE) method is applied to cast the rate maximization into a separately convex optimization problem, which can be iteratively solved with a guaranteed convergence. The provided rate maximization framework is also shown to provide a converging minimum mean squared error (MMSE) design as a special case. Moreover, a methodology to obtain the least favorable error matrices is proposed by casting the resulting non-convex quadratic optimization into a convex problem. The achievable guaranteed (worst-case) rate is then numerically studied, over different levels of CSI error intensity, transceiver accuracy, and available transmit power.

Includes members:
  Member "multi objective optimization for robust power efficient and secure full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "robust beamforming for secure communication in systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "full duplex relay with jamming protocol for improving physical layer security":
    also connected through other hyperedges:
      (none)
  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 "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "power and subcarrier allocation for physical layer security in ofdma based broadband wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subcarrier pairing as channel gain tailoring joint resource allocation for relay assisted secure ofdma with untrusted users")

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)