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: "fading improves connectivity in vehicular ad hoc networks"
  Abstract: Connectivity analysis is a crucial metric for network performance in vehicular ad-hoc networks (VANETs). Although VANET connectivity has been intensively studied and investigated under channel models without fading for their simplicity, the connectivity probability provided by these studies does not mimic the real-world scenarios that suffer from channel impairments. However, the connectivity probability was too challenging to be caught by a closed formula due to the emerging complexity associated with the randomness in a fading channel. In this paper, we precisely estimate the connectivity probability using a proposed graph-based algorithm. The results prove that Rayleigh-fading channels reinforce the connectivity compared to no-fading models at the same level of transmitting power and vehicle densities. Using simulations and analysis, we thoroughly investigate these outcomes and their causes providing closed formulas for single-link connectivity and an upper bound for vehicle connectivity under fading conditions. We also exploit the numeric results of the proposed algorithm to deduce an upper bound for the VANET connectivity probability under Rayleigh-fading channels.

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)