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: "a fully distributed algorithm for throughput performance in wireless networks"
  Abstract: We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle without queues growing indefinitely. Our algorithm achieves two important goals: (i) efficiency is independent of the size of the network, and (ii) the algorithm is fully distributed, i.e., individual nodes need no information about the overall network topology, not even local information.

Connected through hyperedge HE-1 (induced by source paper "wireless link capacity under shadowing and fading"):
  with members:
    - "3d channel model in 3gpp"
    - "beyond geometry towards fully realistic wireless models"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "wireless connectivity and capacity"
    - "wireless capacity with oblivious power in general metrics"

Connected through hyperedge HE-2 (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-3 (induced by source paper "dynamic packet scheduling in wireless networks"):
  with members:
    - "randomized communication in radio networks"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "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"
    - "approximation algorithms for secondary spectrum auctions"

Connected through hyperedge HE-4 (induced by source paper "algorithms for wireless capacity"):
  with members:
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "the power of non uniform wireless power"
    - "wireless capacity and admission control in cognitive radio"
    - "wireless connectivity and capacity"
    - "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"
    - "approximation algorithms for secondary spectrum auctions"

Connected through hyperedge HE-5 (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"
    - "wireless network stability in the sinr model"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "wireless network stability in the sinr model"):
  with members:
    - "dynamic packet scheduling in wireless networks"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"
    - "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"

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)