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 and robust power allocation for visible light positioning systems under illumination constraints"
  Abstract: The problem of optimal power allocation among light emitting diode (LED) transmitters in a visible light positioning (VLP) system is considered for the purpose of improving localization performance of visible light communication (VLC) receivers. Specifically, the aim is to minimize the Cram\'{e}r-Rao lower bound (CRLB) on the localization error of a VLC receiver by optimizing LED transmission powers in the presence of practical constraints such as individual and total power limitations and illuminance constraints. The formulated optimization problem is shown to be convex and thus can efficiently be solved via standard tools. We also investigate the case of imperfect knowledge of localization parameters and develop robust power allocation algorithms by taking into account both overall system uncertainty and individual parameter uncertainties related to the location and orientation of the VLC receiver. In addition, we address the total power minimization problem under predefined accuracy requirements to obtain the most energy-efficient power allocation vector for a given CRLB level. Numerical results illustrate the improvements in localization performance achieved by employing the proposed optimal and robust power allocation strategies over the conventional uniform and non-robust approaches.

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)