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 "secure routing with power optimization for ad hoc networks"):
  Abstract: In this paper, we consider the problem of joint secure routing and transmit power optimization for a multi-hop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process (PPP). Secrecy messages are delivered from a source to a destination through a multi-hop route connected by multiple legitimate relays in the network. Our goal is to minimize the end-to-end connection outage probability (COP) under the constraint of a secrecy outage probability (SOP) threshold, by optimizing the routing path and the transmit power of each hop jointly. We show that the globally optimal solution could be obtained by a two-step procedure where the optimal transmit power has a closed-form and the optimal routing path can be found by Dijkstra's algorithm. Then a friendly jammer with multiple antennas is applied to enhance the secrecy performance further, and the optimal transmit power of the jammer and each hop of the selected route is investigated. This problem can be solved optimally via an iterative outer polyblock approximation with one-dimension search algorithm. Furthermore, suboptimal transmit powers can be derived using the successive convex approximation (SCA) method with a lower complexity. Simulation results show the performance improvement of the proposed algorithms for both non-jamming and jamming scenarios, and also reveal a non-trivial trade-off between the numbers of hops and the transmit power of each hop for secure routing.

Includes members:
  Member "physical layer security jamming theoretical limits and practical designs in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency optimization for secure transmission in miso cognitive radio network with energy harvesting")
  Member "secure transmission in linear multihop relaying networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "a primer on cellular network analysis using stochastic geometry":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "physical layer security in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "secure routing in multihop wireless ad hoc networks with decode and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "optimizing df cognitive radio networks with full duplex enabled energy access points":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "max min fairness user scheduling and power allocation in full duplex ofdma systems")
  Member "principles of physical layer security in multiuser wireless networks a survey":
    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 "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mixed monotonic programming for fast global optimization")

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)