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: "wireless network stability in the sinr model"
  Abstract: We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model. #R##N#Specifically, we make the following contributions. We give a distributed algorithm that achieves $\Omega(\frac{1}{\log^2 n})$-efficiency on all networks (where $n$ is the number of links in the network), for all length monotone, sub-linear power assignments. For the power control version of the problem, we give a distributed algorithm with $\Omega(\frac{1}{\log n(\log n + \log \log \Delta)})$-efficiency (where $\Delta$ is the length diversity of the link set).

Connected through hyperedge HE-1 (induced by source paper "the power of non uniform wireless power"):
  with members:
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "dynamic packet scheduling in wireless networks"
    - "on the problem of wireless scheduling with linear power levels"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "the topology of wireless communication"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"

Connected through hyperedge HE-2 (induced by source paper "link scheduling for throughput maximization in multihop wireless networks under physical interference"):
  with members:
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"
    - "a fully distributed algorithm for throughput performance in wireless networks"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "wireless scheduling with power control"
    - "distributed link scheduling with constant overhead"

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)