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 "algorithms for scheduling with power control in wireless networks"):
  Abstract: In this work we study the following problem of scheduling with power control in wireless networks: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of parallelly transmitting nodes. The signal interference is modeled by SINR constraints. We correct and complement one of the recent papers on this theme, by giving approximation algorithms for scheduling with power control for the case, when the nodes of the network are placed in a doubling metric space.

Includes members:
  Member "algorithms for scheduling with power control in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "the topology of wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resolving sinr queries in a dynamic setting")
  Member "wireless capacity with oblivious power in general metrics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless scheduling with power control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "a note on uniform power connectivity in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deterministic protocols in the sinr model without knowledge of coordinates")
  Member "sinr diagrams towards algorithmically usable sinr models of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "is our model for contention resolution wrong")

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)