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

Connected through hyperedge HE-1 (induced by source paper "beyond geometry towards fully realistic wireless models"):
  with members:
    - "wireless scheduling algorithms in complex environments"
    - "jamming resistant learning in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "the power of non uniform wireless power"

Connected through hyperedge HE-2 (induced by source paper "on the problem of wireless scheduling with linear power levels"):
  with members:
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "algorithms for scheduling with power control in wireless networks"
    - "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"
    - "a note on uniform power connectivity in the sinr model"

Connected through hyperedge HE-3 (induced by source paper "algorithms for scheduling with power control in wireless networks"):
  with members:
    - "the topology of wireless communication"
    - "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"
    - "a note on uniform power connectivity in the sinr model"
    - "sinr diagrams towards algorithmically usable sinr models of wireless networks"

Connected through hyperedge HE-4 (induced by source paper "multi hop routing and scheduling in wireless networks in the sinr model"):
  with members:
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "algorithms for scheduling with power control in wireless networks"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "wireless scheduling with power control"):
  with members:
    - "algorithms for scheduling with power control in wireless networks"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "sinr diagrams towards algorithmically usable sinr models of wireless networks"
    - "opportunity cost algorithms for combinatorial auctions"

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)