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 "secrecy energy efficiency of mimome wiretap channels with full duplex jamming"):
  Abstract: Full-duplex (FD) jamming transceivers are recently shown to enhance the information security of wireless communication systems by simultaneously transmitting artificial noise (AN) while receiving information. In this work, we investigate if FD jamming can also improve the systems secrecy energy efficiency (SEE) in terms of securely communicated bits-per- Joule, when considering the additional power used for jamming and self-interference (SI) cancellation. Moreover, the degrading effect of the residual SI is also taken into account. In this regard, we formulate a set of SEE maximization problems for a FD multiple-input-multiple-output multiple-antenna eavesdropper (MIMOME) wiretap channel, considering both cases where exact or statistical channel state information (CSI) is available. Due to the intractable problem structure, we propose iterative solutions in each case with a proven convergence to a stationary point. Numerical simulations indicate only a marginal SEE gain, through the utilization of FD jamming, for a wide range of system conditions. However, when SI can efficiently be mitigated, the observed gain is considerable for scenarios with a small distance between the FD node and the eavesdropper, a high Signal-to-noise ratio (SNR), or for a bidirectional FD communication setup.

Includes members:
  Member "multi tenant c ran with spectrum pooling downlink optimization under privacy constraints":
    also connected through other hyperedges:
      (none)
  Member "exploiting full duplex receivers for achieving secret communications in multiuser miso networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "softnull many antenna full duplex wireless via digital beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "a survey of energy efficient techniques for 5g networks and challenges ahead":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "hardware impairments aware transceiver for full duplex massive mimo relaying":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "intelligent reflecting surface enhanced wireless network two timescale beamforming optimization")
  Member "multi objective optimization for robust power efficient and secure full duplex wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "exploiting full duplex receivers for achieving secret communications in multiuser miso networks")
  Member "robust beamforming for secure communication in systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading 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)