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 "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"):
  Abstract: We consider a broadcast channel in which a multi-antenna transmitter (Alice) sends    $K$    confidential information signals to    $K$    legitimate users (Bobs) in the presence of    $L$    eavesdroppers (Eves). Alice uses multiple-input multiple-output (MIMO) precoding to generate the information signals along with her own (Tx-based) friendly jamming (FJ). Interference at each Bob is removed by MIMO zero-forcing. This, however, leaves a “vulnerability region” around each Bob, which can be exploited by a nearby Eve. We address this problem by augmenting Tx-based FJ (TxFJ) with Rx-based FJ (RxFJ), generated by each Bob. Specifically, each Bob uses self-interference suppression to transmit a friendly jamming signal, while simultaneously receiving an information signal over the same channel. We minimize the powers allocated to the information, TxFJ, and RxFJ signals under given guarantees on the individual secrecy rate for each Bob. The problem is solved for the cases when the eavesdropper’s channel state information is known/unknown. Simulations show the effectiveness of the proposed solution. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satisfied on average rather than instantaneously. Under special cases, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers.

Includes members:
  Member "individual secrecy for broadcast channels with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "individual secrecy for the broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "can marton coding alone ensure individual secrecy")
  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 "joint design of optimal cooperative jamming and power allocation for linear precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy energy efficiency of mimome wiretap channels with full duplex jamming")
  Member "on the degrees of freedom of the mimo wiretap and mimo broadcast channels with unknown eavesdroppers":
    also connected through other hyperedges:
      (none)
  Member "improving physical layer secrecy using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  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 "mimo gaussian broadcast channels with confidential and common messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial noise aided biobjective transmitter optimization for service integration in multi user mimo broadcast channel")

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)