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 "an upper bound on multihop transmission capacity with dynamic routing selection"):
  Abstract: This paper develops upper bounds on the end-to-end transmission capacity of multihop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows insights into how the number of hops and other network parameters affect spatial throughput in the nonasymptotic regime. The outage probability analysis is then extended to account for retransmissions with a maximum number of allowed attempts. In contrast to prevailing wisdom, we show that predetermined routing (such as nearest neighbor) is suboptimal, since more hops are not useful once the network is interference-limited. Our results also make clear that randomness in the location of relay sets and dynamically varying channel states is helpful in obtaining higher aggregate throughput, and that dynamic route selection should be used to exploit path diversity.

Includes members:
  Member "multicast outage probability and transmission capacity of multihop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a general mimo framework for noma downlink and uplink transmission based on signal alignment")
  Member "throughput delay reliability tradeoff with arq in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "delay analysis of spatially coded mimo zfbf with retransmissions in random networks")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "transmission capacities for overlaid wireless ad hoc networks with outage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum access")
  Member "transmission capacity of ad hoc networks with multiple antennas using transmit stream adaptation and interference cancelation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance analysis of outdoor mmwave ad hoc networks")
  Member "analysis of uncoordinated opportunistic two hop wireless ad hoc systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a stochastic geometry based approach to modeling interference correlation in cooperative relay networks")
  Member "spectrum sharing between cellular and mobile ad hoc networks transmission capacity trade off":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatial and temporal analysis of direct communications from static devices to mobile vehicles")

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)