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: "optimal information theoretic wireless location verification"
  Abstract: We develop a new location verification system (LVS) focused on network-based intelligent transport systems (ITSs) and vehicular ad hoc networks (VANETs). The system that we develop is based on an information-theoretic framework in which the mutual information between the system's input and output data is maximized. Our system takes as inputs a user's claimed location and base station (BS) received signal strength (RSS) measurements to form an optimal decision rule on the legitimacy of the claimed location. The scenario that we consider is where a noncolluding malicious user alters his transmit power in an attempt to fool the LVS. We develop a practical threat model for this attack scenario and investigate the performance of the LVS in terms of its input/output mutual information. We show how our LVS decision rule can be straightforwardly implemented with a performance that delivers near optimality under realistic threat conditions. The practical advantages that our new information-theoretic scheme delivers, relative to more traditional Bayesian verification frameworks, are discussed.

Connected through hyperedge HE-1 (induced by source paper "location verification systems under spatially correlated shadowing"):
  with members:
    - "location verification systems for vanets in rician fading channels"
    - "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"
    - "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:
    - "location verification systems for vanets in rician fading channels"
    - "signalling storms in 3g mobile networks"
    - "an information theoretic location verification system for wireless networks"

Connected through hyperedge HE-3 (induced by source paper "location verification systems for vanets in rician fading channels"):
  with members:
    - "location spoofing detection for vanets by a single base station in rician fading channels"
    - "statistical characterization of kappa mu shadowed fading"

Connected through hyperedge HE-4 (induced by source paper "location spoofing detection for vanets by a single base station in rician fading channels"):
  with members:
    - "location verification systems for vanets in rician fading channels"
    - "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.IT(Information Theory)