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 "apply artificial noise to secure fading relay networks a ser based approach"):
  Abstract: We apply the concept of artificial and controlled interference in a triangular relay network with an untrusted relay aiming at enhancing the wireless communication secrecy between the source and the destination node. In order to shield the square quadrature amplitude modulated (QAM) signals transmitted from the source node to the relay, the destination node designs and transmits artificial noise (AN) symbols to jam the relay reception. The objective of our considered AN design is to degrade the error probability performance at the untrusted relay, for different types of channel state information (CSI) at the destination. By considering perfect knowledge of the instantaneous CSI of the source-to-relay and relay-to-destination links, we first present an analytical expression for the symbol error rate (SER) performance at the relay. Based on the assumption of an average power constraint at the destination node, we then derive the optimal phase and power distribution of the AN that maximizes the SER at the relay. Furthermore, we obtain the optimal AN design for the case where only statistical CSI is available at the destination node. For both cases, our study reveals that the Gaussian distribution is generally not optimal to generate AN symbols. In particular, the conducted numerical results show that the Gaussian distributed AN is far from optimal. The presented AN design takes into account practical parameters for the communication links, such as QAM signaling and maximum likelihood decoding.

Includes members:
  Member "secure communication via an untrusted non regenerative relay in fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing physical layer security in af relay assisted multicarrier wireless transmission enhancing physical layer security in af relay assisted multicarrier wireless transmission")
  Member "imbalanced beamforming by a multi antenna source for secure utilization of an untrusted relay":
    also connected through other hyperedges:
      (none)
  Member "jamming games in the mimo wiretap channel with an active eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cell free massive mimo networks optimal power control against active eavesdropping")
  Member "new results on multiple input multiple output broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "secrecy sum rates for multi user mimo regularized channel inversion precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "a tutorial on the optimization of amplify and forward mimo relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficiency fairness for multi pair wireless powered relaying systems")
  Member "physical layer network coding tutorial survey and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "solutions for the mimo gaussian wiretap channel with a cooperative jammer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi antenna jamming in covert communication")

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)