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: "on the problem of wireless scheduling with linear power levels"
  Abstract: In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender node the power is constant times the path loss between the sender and corresponding receiver. This is the minimal power for a successful transmission. We present a constant factor deterministic approximation algorithm, which works for at least Euclidean fading metrics. Simultaneously we obtain the approximate value of the optimal schedule length with error at most a constant factor. To give an insight into the complexity of the problem, we show that in some metric spaces the problem is NP-hard and cannot be approximated within a factor less than 1.5.

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"
    - "wireless network stability in the sinr model"
    - "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 "nearly optimal bounds for distributed wireless scheduling in the sinr model"):
  with members:
    - "distributed connectivity of wireless networks"
    - "the power of non uniform wireless power"
    - "algorithms for wireless capacity"
    - "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"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "wireless scheduling with power control"

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)