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: "performance analysis of energy buffer aided wireless powered communication"
  Abstract: In this paper, we consider a wireless powered communication system, where an energy harvesting (EH) node harvests energy from a radio frequency (RF) signal broadcasted by an access point (AP) in the downlink (DL). The node stores the harvested energy in an energy buffer and uses the stored energy to transmit data to the AP in the uplink (UL). We investigate two simple transmission policies, namely a best-effort policy and an on-off policy, which do not require knowledge of the EH profile nor of the UL channel state information. In particular, for both policies, the EH node transmits in each time slot with a constant desired power if sufficient energy is available in its energy buffer. Otherwise, the node transmits with the maximum possible power in the best-effort policy and remains silent in the on-off policy in order to preserve its energy for future use. For both policies, we use the theory of discrete-time continuous-state Markov chains to analyze the limiting distribution of the stored energy for finite- and infinite-size energy buffers. We provide this limiting distribution in closed form for a Nakagami-$m$ fading DL channel, i.e., for a Gamma distributed EH process. Furthermore, for a Nakagami-$m$ fading UL channel, we analyze the outage probability and the average throughput for both policies. Our results reveal that, for low-to-medium outage probabilities, the best-effort policy is superior to the on-off policy and the optimal maximum UL transmit power of the EH node that minimizes the outage probability is always less than the average harvested power but increases with the capacity of the energy buffer. The opposite behaviour is observed for high outage probabilities, where turning off the transmission in case of insufficient stored energy results in an improved outage performance compared to always transmitting with best effort.

Connected through hyperedge HE-1 (induced by source paper "on the performance of wireless powered communication with non linear energy harvesting"):
  with members:
    - "robust resource allocation for mimo wireless powered communication networks based on a non linear eh model"
    - "on the performance of multi antenna wireless powered communications with energy beamforming"
    - "wireless powered communication networks an overview"
    - "communications and signals design for wireless power transmission"
    - "practical non linear energy harvesting model and resource allocation for swipt systems"
    - "energy efficient resource allocation for wireless powered communication networks"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "wireless networks with rf energy harvesting a contemporary survey"

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)