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: "bounds on stability and latency in wireless communication"
  Abstract: In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless communication. More precisely, there is an adversary that specifies transmission rates of wireless links and injects data in such a way that an average number of data injected in a single round and routed through a single wireless link is at most $r$, for a given $r\in (0,1)$. We also assume that the additional "burst" of data injected during any time interval and scheduled via a single link is bounded by a given parameter $b$. #R##N#Under this scenario, we show that the nodes following so called {\em work-conserving} scheduling policies, not necessarily the same, are guaranteed stability (i.e., bounded queues) and reasonably small data latency (i.e., bounded time on data delivery), for injection rates $r<1/d$, where $d$ is the maximum length of a routing path. Furthermore, we also show that such a bound is asymptotically optimal on $d$.

Connected through hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "routing in wireless networks with interferences"
    - "universal routing in multi hop radio networks"
    - "stability of the max weight protocol in adversarial wireless networks"

Connected through hyperedge HE-2 (induced by source paper "probabilistic stability of traffic load balancing on wireless complex networks"):
  with members:
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "joint load balancing and interference mitigation in 5g heterogeneous networks"
    - "self optimizing load balancing with backhaul constrained radio access networks"
    - "contractive interference functions and rates of convergence of distributed power control laws"

Connected through hyperedge HE-3 (induced by source paper "routing in wireless networks with interferences"):
  with members:
    - "stability of the max weight protocol in adversarial wireless networks"
    - "dynamic packet scheduling in wireless networks"

Connected through hyperedge HE-4 (induced by source paper "universal routing in multi hop radio networks"):
  with members:
    - "stability of the max weight protocol in adversarial wireless networks"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-5 (induced by source paper "dynamic packet scheduling in wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless 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.NI(Networking and Internet Architecture)