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: "revisiting 802 11 for user fairness and efficient channel utilization in presence of lte u"
  Abstract: A promising solution satisfying the industry's demand to have minimum alterations in LTE for its operation in unlicensed spectrum is duty cycled LTE-U scheme, which adopts discontinuous transmission to ensure fair coexistence with 802.11 (Wi-Fi) WLANs. Even though the scheme guarantees to maintain Wi-Fi network performance, the fairness among Wi-Fi users still remains arcane. In this work, we present a practical scenario where LTE-U, despite being discontinuous (by following an ON-OFF cycle), results in not only unfair throughput distribution among Wi-Fi users but also causes degradation in Wi-Fi APs downlink performance. This is due to the domination of few Wi-Fi users who harness channel in both ON and OFF durations of LTE-U, namely non-victim users over those who get access only in OFF duration, called victim users. In this paper, we studied the performance of victim and non-victim Wi-Fi users, and Wi-Fi AP while varying LTE-U ON duration (i.e., duty cycle). A propitious scheme is proposed for WLANs, with regard to ease of implementation, employing Point Coordination Function (PCF) mode of 802.11, promising fairness among Wi-Fi users with improvement in the channel utilization of Wi-Fi network. An analytical model is developed to demonstrate guaranteed improvement and validate the simulation results.

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)