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: "single anchor two way localization bounds for 5g mmwave systems two protocols"
  Abstract: Recently, mmWave 5G localization has been shown to be a promising technology to achieve centimetre-level accuracy. This generates more opportunities for location-aware communication applications. One assumption usually made in the investigation of localization methods is that the user equipment (UE) and the base station (BS) are synchronized. However, in reality, communications systems are not finely synchronized to a level useful for localization. Therefore, in this paper, we investigate two-way localization protocols that avoid the prerequisite of tight time synchronization. Namely, we consider a distributed localization protocol (DLP), whereby the BS and UE exchange signals in two rounds of transmission and then localization is achieved using the signal received in the second round. On the other hand, we also consider a centralized localization protocol (CLP), whereby localization is achieved using the signals received in the two rounds. We derive the position (PEB) and orientation error bounds (OEB) applying beamforming at both ends and compare them to the traditional one-way localization. Our results obtained using realistic system parameters show that mmWave localization is mainly limited by angular rather than temporal estimation and that CLP significantly outperforms DLP. Our simulations also show that it is more beneficial to have more antennas at the BS than at the UE.

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)