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: "online policies for throughput maximization of energy constrained wireless powered communication systems"
  Abstract: In this paper, we consider the design of online transmission policies in a single-user wireless-powered communication system over an infinite horizon, aiming at maximizing the long-term system throughput for the user equipment (UE) subject to a given energy budget. The problem is formulated as a constrained Markov decision process problem, which is subsequently converted into an equivalent Markov decision process (MDP) problem via the Lagrangian approach. The corresponding optimal resource allocation policy is obtained through jointly solving the corresponding MDP problem and updating the Lagrangian multiplier. To reduce the complexity, a sub-optimal policy named “quasi-best-effort” is proposed, where the transmit power of the UE is structurally designed so that in each block the UE either exhausts its entire battery energy for transmission or suspends its transmission. To validate the effectiveness of our proposed policy, extensive numerical simulations are conducted with various system parameters. The results show that the proposed quasi-best-effort policy requires far less computation time but achieves a similar long-term throughput performance as the optimal policy.

Connected through hyperedge HE-1 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks"):
  with members:
    - "optimal and near optimal policies for wireless power transfer in energy limited and power limited scenarios"
    - "optimal hierarchical radio resource management for hetnets with flexible backhaul"
    - "distributed wireless power transfer with energy feedback"
    - "theory and experiment for wireless powered sensor networks how to keep sensors alive"
    - "battery powered devices in wpcns"
    - "capacity of remotely powered communication"
    - "wireless powered communication opportunities and challenges"
    - "wireless power transfer survey and roadmap"

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)