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: "wi fi wigig coordination for optimal wigig concurrent transmissions in random access scenarios"
  Abstract: Wireless Gigabit (WiGig) access points (APs) using 60 GHz unlicensed frequency band are considered as key enablers for future Gbps WLANs. Due to its short range transmission with high susceptibility to path blocking, a multiple number of WiGig APs should be installed to fully cover a typical target environment. However, using autonomously operated WiGig APs with IEEE 802.11ad DCF, the exhaustive search analog beamforming and the maximum received power based autonomous users association prevent the establishment of optimal WiGig concurrent links that maximize the total system throughput in random access scenarios. In this paper, we formulate the problem of WiGig concurrent transmissions in random access scenarios as an optimization problem, then we propose a Wi-Fi/WiGig coordination architecture to solve it. The proposed coordinated Wi-Fi/WiGig WLAN is based on a tight coordination between the 5 GHz (Wi-Fi) and the 60 GHz (WiGig) unlicensed frequency bands. By which, the wide coverage Wi-Fi band controls the establishment of the WiGig concurrent links. Statistical learning using Wi-Fi fingerprinting is used for estimating the best candidate AP and its best beam identification (ID) for establishing the WiGig concurrent link without making any interference to the existing WiGig data links.

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)