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 "mimo df relay beamforming for secrecy with artificial noise imperfect csi and finite alphabet"):
  Abstract: In this paper, we consider decode-and-forward (DF) relay beamforming with imperfect channel state information (CSI), cooperative artificial noise (AN) injection, and finite-alphabet input in the presence of an user and $J$ non-colluding eavesdroppers. The communication between the source and the user is aided by a multiple-input-multiple-output (MIMO) DF relay. We use the fact that a wiretap code consists of two parts: i) common message (non-secret), and ii) secret message. The source transmits two independent messages: i) common message (non-secret), and ii) secret message. The common message is transmitted at a fixed rate $R_{0}$, and it is intended for the user. The secret message is also intended for the user but it should be kept secret from the $J$ eavesdroppers. The source and the MIMO DF relay operate under individual power constraints. In order to improve the secrecy rate, the MIMO relay also injects artificial noise. The CSI on all the links are assumed to be imperfect and CSI errors are assumed to be norm bounded. In order to maximize the worst case secrecy rate, we maximize the worst case link information rate to the user subject to: i) the individual power constraints on the source and the MIMO relay, and ii) the best case link information rates to $J$ eavesdroppers be less than or equal to $R_{0}$ in order to support a fixed common message rate $R_{0}$. Numerical results showing the effect of perfect/imperfect CSI, presence/absence of AN with finite-alphabet input on the secrecy rate are presented.

Includes members:
  Member "power allocation in mimo wiretap channel with statistical csi and finite alphabet input":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "robust secure transmission in miso channels based on worst case optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul")
  Member "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rethinking secure precoding via interference exploitation a smart eavesdropper perspective")
  Member "on cooperative relaying schemes for wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "collaborative relay beamforming for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective optimization criteria and relay selection algorithms for physical layer security in multiple antenna relay networks")
  Member "secrecy capacity of the gaussian wire tap channel with finite complex constellation input":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "power allocation in mimo wiretap channel with statistical csi and finite alphabet input")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)