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 "optimal and suboptimal routing based on partial csi in random ad hoc networks"):
  Abstract: In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geographical locations, the channel gains of its neighbor nodes and the statistical characterization of all other nodes. While many routing problems are formulated as optimization problems, the optimal distributed solution is rarely accessible. In this work, we present the exact optimal solution for the scenario analyzed. The optimal routing is given as a maximization of a routing metric which depends solely on the known partial channel state information (CSI) and includes an expectation with respect to the interference statistics. The optimal routing scheme is important because it gives an upper bound on the performance of any other routing scheme. We also present sub-optimal routing schemes that only use part of the available knowledge and require much lower computational complexity. Numerical results demonstrate that the performance of the low complexity schemes is close to optimal and outperforms other tested routing schemes.

Includes members:
  Member "ergodic spectral efficiency in mimo cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive mimo forward link analysis for cellular networks")
  Member "multihop routing in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance comparisons of geographic routing protocols in mobile ad hoc networks")
  Member "random linear multihop relaying in a general field of interferers using spatial aloha":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coverage and rate analysis of downlink cellular vehicle to everything c v2x communication")
  Member "a selection region based routing protocol for random mobile ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a selection region based routing protocol for random mobile ad hoc networks with directional antennas")
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure transmission in linear multihop relaying networks")

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)