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 near optimal policies for wireless power transfer in energy limited and power limited scenarios"
  Abstract: Radio frequency wireless power transfer (RF-WPT) is an emerging technology that enables transferring energy from an energy access point (E-AP) to multiple energy receivers (E-Rs), in a wireless manner. In practice, there are some restrictions on the power level or the amount of energy that the E-AP can transfer, which need to be considered in order to determine a proper power transfer policy for the E-AP. In this paper, we formulate the problem of finding the optimal policy for two practical scenarios of powerlimited and energy-limited E-APs. The formulated problems are non-convex stochastic optimization problems that are very challenging to solve. We propose optimal and near-optimal policies for the power transfer of the E-AP to the E-Rs, where the optimal solutions require statistical information of the channel states, while the near-optimal solutions do not require such information and perform well in practice. Furthermore, to ensure fairness among E-Rs, we propose two fair policies, namely Max- Min Fair policy and quality-of-service-aware Proportional Fair policy. MMF policy targets maximizing the minimum received power among the E-Rs, and QPF policy maximizes the total received power of the E-Rs, while guaranteeing the required minimum QoS for each E-R. Various numerical results demonstrate the significant performance of the proposed policies.

Connected through hyperedge HE-1 (induced by source paper "an energy efficient controller for wirelessly powered communication networks"):
  with members:
    - "swipt using hybrid arq over time varying channels"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "joint transfer of energy and information in a two hop relay channel"
    - "optimal energy and data routing in networks with energy cooperation"
    - "battery powered devices in wpcns"
    - "wireless powered relaying with finite block length codes"
    - "on wireless energy and information transfer in relay networks"
    - "communications and signals design for wireless power transmission"

Connected through hyperedge HE-2 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks"):
  with members:
    - "online policies for throughput maximization of energy constrained wireless powered communication systems"
    - "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)