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 "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).

Includes members:
  Member "a fully distributed algorithm for throughput performance in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless link capacity under shadowing and fading")
  Member "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "nearly optimal bounds for distributed wireless scheduling in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "wireless capacity and admission control in cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless capacity with oblivious power in general metrics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless scheduling with power control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effective wireless scheduling via hypergraph sketches")

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.NI(Networking and Internet Architecture)