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: "an energy efficient controller for wirelessly powered communication networks"
  Abstract: In a wirelessly-powered communication network (WPCN), an energy access point (E-AP) supplies the energy needs of the network nodes through radio frequency wave transmission, and the nodes store their received energy in their batteries for possible data transmission. In this paper, we propose an online control policy for energy transfer from the E-AP to the wireless nodes and for data transfer among the nodes. With our proposed control policy, all data queues of the nodes are stable, while the average energy consumption of the network is shown to be within a bounded gap of the minimum energy required for stabilizing the network. Our proposed policy is designed using a quadratic Lyapunov function to capture the limitations on the energy consumption of the nodes imposed by their battery levels. We show that under the proposed control policy, the backlog level in the data queues and the stored energy level in the batteries fluctuate in small intervals around some constant levels. Consequently, by imposing negligible average data drop rate, the data buffer size and the battery capacity of the nodes can be significantly reduced.

Connected through hyperedge HE-1 (induced by source paper "parallel stochastic optimization framework for large scale non convex stochastic problems"):
  with members:
    - "efficient fair and qos aware policies for wirelessly powered communication networks"
    - "accelerating minibatch stochastic gradient descent using typicality sampling"
    - "learning overparameterized neural networks via stochastic gradient descent on structured data"
    - "on breast cancer detection an application of machine learning algorithms on the wisconsin diagnostic dataset"
    - "energy entropy competition and the effectiveness of stochastic gradient descent in machine learning"
    - "optimal hierarchical radio resource management for hetnets with flexible backhaul"
    - "adam a method for stochastic optimization"
    - "flexible parallel algorithms for big data optimization"

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)