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: "location verification systems for vanets in rician fading channels"
  Abstract: In this paper, we propose and examine location verification systems (LVSs) for vehicular ad hoc networks (VANETs) in the realistic setting of Rician fading channels. In our LVSs, a single authorized base station (BS) equipped with multiple antennas aims to detect a malicious vehicle that is spoofing its claimed location. We first determine the optimal attack strategy of the malicious vehicle, which, in turn, allows us to analyze the optimal LVS performance as a function of the Rician    $K$  - factor of the channel between the BS and a legitimate vehicle. Our analysis also allows us to formally prove that the LVS performance limit is independent of the properties of the channel between the BS and the malicious vehicle, provided the malicious vehicle's antenna number is above a specified value. We also investigate how tracking information on a vehicle quantitatively improves the detection performance of an LVS, showing how optimal performance is obtained under the assumption of the tracking length being randomly selected. The work presented here can be readily extended to multiple BS scenarios and, therefore, forms the foundation for all optimal location authentication schemes within the context of Rician fading channels. Our study closes important gaps in the current understanding of LVS performance within the context of VANETs and will be of practical value to certificate revocation schemes within IEEE 1609.2.

Connected through hyperedge HE-1 (induced by source paper "location verification systems under spatially correlated shadowing"):
  with members:
    - "map aware models for indoor wireless localization systems an experimental study"
    - "location spoofing detection for vanets by a single base station in rician fading channels"
    - "optimal information theoretic wireless location verification"
    - "cramer rao bounds for joint rss doa based primary user localization in cognitive radio networks"
    - "an information theoretic location verification system for wireless networks"

Connected through hyperedge HE-2 (induced by source paper "geo spatial location spoofing detection for internet of things"):
  with members:
    - "signalling storms in 3g mobile networks"
    - "optimal information theoretic wireless location verification"
    - "an information theoretic location verification system for wireless networks"

Connected through hyperedge HE-3 (induced by source paper "location spoofing detection for vanets by a single base station in rician fading channels"):
  with members:
    - "optimal information theoretic wireless location verification"
    - "location verification systems in emerging wireless networks"

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)