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 rate maximization with outage constraint in multihop relaying networks"):
  Abstract: In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford algorithm. Simulation results are conducted to verify our analysis.

Includes members:
  Member "energy efficient routing in wireless networks in the presence of jamming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient secrecy in wireless networks based on random jamming")
  Member "physical layer security of a buffer aided full duplex relaying system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "link selection for secure cooperative networks with buffer aided relaying")
  Member "secure routing in multihop wireless ad hoc networks with decode and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "artificial noise aided secrecy information and power transfer in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "energy harvesting for physical layer security in ofdma networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy outage of swipt in the presence of cooperating eavesdroppers")
  Member "when does relay transmission give a more secure connection in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure transmission in linear multihop relaying networks")
  Member "optimal relay selection for physical layer security in cooperative wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secrecy outage analysis of non orthogonal spectrum sharing for heterogeneous cellular networks")
  Member "relay placement for physical layer security a secure connection perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "link selection for secure cooperative networks with buffer aided relaying")

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)