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: "energy harvesting wireless networks with correlated energy sources"
  Abstract: This work considers a system with two energy harvesting (EH) nodes transmitting to a common destination over a random access channel. The amount of harvested energy is assumed to be random and independent over time, but correlated among the nodes possibly with respect to their relative position. A threshold-based transmission policy is developed for the maximization of the expected aggregate network throughput. Assuming that there is no a priori channel state or EH information available to the nodes, the aggregate network throughput is obtained. The optimal thresholds are determined for two practically important special cases: i) at any time only one of the sensors harvests energy due to, for example, physical separation of the nodes; ii) the nodes are spatially close, and at any time, either both nodes or none of them harvests energy.

Connected through hyperedge HE-1 (induced by source paper "communication over a time correlated channel with an energy harvesting transmitter"):
  with members:
    - "channel sensing and communication over a time correlated channel with an energy harvesting transmitter"
    - "distributed opportunistic scheduling for energy harvesting based wireless networks a two stage probing approach"
    - "multi access communications with energy harvesting a multi armed bandit model and the optimality of the myopic policy"
    - "data driven stochastic models and policies for energy harvesting sensor communications"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"

Connected through hyperedge HE-2 (induced by source paper "channel sensing and communication over a time correlated channel with an energy harvesting transmitter"):
  with members:
    - "distributed opportunistic scheduling for energy harvesting based wireless networks a two stage probing approach"
    - "optimization of energy harvesting miso communication system with feedback"
    - "multi access communications with energy harvesting a multi armed bandit model and the optimality of the myopic policy"
    - "universally near optimal online power control for energy harvesting nodes"
    - "stability analysis of slotted aloha with opportunistic rf energy harvesting"
    - "data driven stochastic models and policies for energy harvesting sensor communications"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"

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.PF(Performance)