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: "control theoretic optimization of 802 11 wlans implementation and experimental evaluation"
  Abstract: In 802.11 WLANs, adapting the contention parameters to network conditions results in substantial performance improvements. Even though the ability to change these parameters has been available in standard devices for years, so far no adaptive mechanism using this functionality has been validated in a realistic deployment. In this paper we report our experiences with implementing and evaluating two adaptive algorithms based on control theory, one centralized and one distributed, in a large-scale testbed consisting of 18 commercial off-the-shelf devices. We conduct extensive measurements, considering different network conditions in terms of number of active nodes, link qualities, and data traffic. We show that both algorithms significantly outperform the standard configuration in terms of total throughput. We also identify the limitations inherent in distributed schemes, and demonstrate that the centralized approach substantially improves performance under a large variety of scenarios, which confirms its suitability for real deployments.

Connected through hyperedge HE-1 (induced by source paper "contention window optimization in ieee 802 11ax networks with deep reinforcement learning"):
  with members:
    - "a flexible machine learning aware architecture for future wlans"
    - "a collaborative multi agent reinforcement learning anti jamming algorithm in wireless networks"
    - "deep learning in mobile and wireless networking a survey"
    - "ap initiated multi user transmissions in ieee 802 11ax wlans"
    - "deep reinforcement learning multiple access for heterogeneous wireless networks"

Connected through hyperedge HE-2 (induced by source paper "regulating queueing delay in 802 11ac wlans nonlinear controller analysis and design"):
  with members:
    - "quick and plenty achieving low delay and high rate in 802 11ac edge networks"
    - "low delay random linear coding and scheduling over multiple interfaces"

Connected through hyperedge HE-3 (induced by source paper "orla olaa orthogonal coexistence of laa and wifi in unlicensed spectrum"):
  with members:
    - "fair coexistence of scheduled and random access wireless networks unlicensed lte wifi"
    - "random access preamble design and detection for 3gpp narrowband iot systems"
    - "srslte an open source platform for lte evolution and experimentation"
    - "small cell traffic balancing over licensed and unlicensed bands"
    - "unlicensed lte wifi coexistence is lbt inherently fairer than csat"
    - "rigorous and practical proportional fair allocation for multi rate wi fi"

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)