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 "energy efficiency in secure multi antenna systems"):
  Abstract: The problem of resource allocation in multiple-antenna wiretap channels is investigated, wherein a malicious user tries to eavesdrop the communication between two legitimate users. Both multiple input single output single-antenna eavesdropper (MISO-SE) and multiple input multiple output multiple-antenna eavesdropper (MIMO-ME) systems are considered. Unlike most papers dealing with physical layer security, the focus of the resource allocation process here is not to maximize the secrecy capacity, but rather to maximize the energy efficiency of the system. Two fractional energy-efficient metrics are introduced, namely the ratios between the system secrecy capacity and the consumed power, and between the system secret-key rate and the consumed power. Both performance metrics are measured in bit/Joule, and result in non-concave fractional optimization problems, which are tackled by fractional programming theory and sequential convex optimization. For both performance metrics, the energy-efficient resource allocation is carried out considering both perfect as well as statistical channel state information (CSI) as to the channel from the legitimate transmitter to the eavesdropper.

Includes members:
  Member "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiple antenna technologies for beyond 5g")
  Member "real and complex monotone communication games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on cyber risk management of blockchain networks a game theoretic approach")
  Member "on secrecy capacity of fast fading mimome wiretap channels with statistical csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy rate of distributed cooperative mimo in the presence of multi antenna eavesdropper")
  Member "on the design of artificial noise aided secure multi antenna transmission in slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "explicit solution of worst case secrecy rate for miso wiretap channels with spherical uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "covert secret key generation with an active warden")

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)