human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "secure transmission in linear multihop relaying networks"):
  with members:
    - "secure routing in multihop wireless ad hoc networks with decode and forward relaying"
    - "asymptotic deployment gain a simple approach to characterize the sinr distribution in general cellular networks"
    - "when does relay transmission give a more secure connection in wireless ad hoc networks"
    - "relay placement for physical layer security a secure connection perspective"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "on the throughput cost of physical layer security in decentralized wireless networks"
    - "outage probability of general ad hoc networks in the high reliability regime"
    - "random access transport capacity"

Connected through hyperedge HE-2 (induced by source paper "analysis of information delivery dynamics in cognitive sensor networks using epidemic models"):
  with members:
    - "decapitation via digital epidemics a bio inspired transmissive attack"
    - "cognitive internet of things a new paradigm beyond connection"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "performance comparisons of geographic routing protocols in mobile ad hoc networks"):
  with members:
    - "performance analysis of geographic routing protocols in ad hoc networks"
    - "multihop routing in ad hoc networks"
    - "the outage probability of a finite ad hoc network in nakagami fading"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "random access transport capacity"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "multihop routing in ad hoc networks"):
  with members:
    - "the outage probability of a finite ad hoc network in nakagami fading"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "an overview of the transmission capacity of wireless networks"
    - "random access transport capacity"

Question: Please tell me which class the center node 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)