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: "random access transport capacity"
  Abstract: We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants, which contain most of the design-relevant network parameters. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.

Connected through hyperedge HE-1 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks"):
  with members:
    - "ergodic spectral efficiency in mimo cellular networks"
    - "multihop routing in ad hoc networks"
    - "random linear multihop relaying in a general field of interferers using spatial aloha"
    - "a selection region based routing protocol for random mobile ad hoc networks"

Connected through hyperedge HE-2 (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"
    - "an upper bound on multihop transmission capacity with dynamic routing selection"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "capacity of cellular wireless network"):
  with members:
    - "downlink cellular network analysis with multi slope path loss models"
    - "multi antenna communication in ad hoc networks achieving mimo gains with simo transmission"
    - "a tractable approach to coverage and rate in cellular networks"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (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"
    - "an upper bound on multihop transmission capacity with dynamic routing selection"
    - "the outage probability of a finite ad hoc network in nakagami fading"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"

Connected through hyperedge HE-5 (induced by source paper "location location location border effects in interference limited ad hoc networks"):
  with members:
    - "interference functionals in poisson networks"
    - "analytical modeling of uplink cellular networks"
    - "connectivity of large wireless networks under a generic connection model"
    - "mean interference in hard core wireless networks"
    - "a tractable approach to coverage and rate in cellular networks"
    - "towards a better understanding of large scale network models"

Connected through hyperedge HE-6 (induced by source paper "cooperative relaying for large random multihop networks"):
  with members:
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"
    - "opportunistic routing in ad hoc networks how many relays should there be what rate should nodes use"
    - "spatial analysis of opportunistic downlink relaying in a two hop cellular system"

Connected through hyperedge HE-7 (induced by source paper "achieving non zero information velocity in wireless networks"):
  with members:
    - "a tractable approach to coverage and rate in cellular networks"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"

Connected through hyperedge HE-8 (induced by source paper "transport capacity of distributed wireless csma networks"):
  with members:
    - "towards a simple relationship to estimate the capacity of static and mobile wireless networks"
    - "high sir transmission capacity of wireless networks with general fading and node distribution"
    - "on the throughput delay trade off in georouting networks"
    - "capacity of large scale csma wireless networks"
    - "mean interference in hard core wireless networks"
    - "an overview of the transmission capacity of wireless networks"
    - "effective carrier sensing in csma networks under cumulative interference"
    - "interference and outage in clustered wireless ad hoc networks"

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)