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: "on off transmission policy for wireless powered communication with energy storage"
  Abstract: In this paper, we consider an energy harvesting (EH) node which 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 consider a simple transmission policy, which accounts for the fact that, in practice, the EH node may not have knowledge of the EH profile nor of the UL channel state information. In particular, in each time slot, the EH node transmits with either a constant desired power or remains silent if not enough energy is available in its energy buffer. For this simple policy, 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. Moreover, we take into account imperfections of the energy buffer and the circuit power consumption of the EH node. For a Rayleigh fading DL channel, we provide the limiting distribution of the energy buffer content in closed form. In addition, we analyze the average error rate and the outage probability of a Rayleigh faded UL channel and show that the diversity order is not affected by the finite capacity of the energy buffer. Our results reveal that, for medium to high signal-to-noise ratio (SNRs), the optimal target transmit power of the EH node is less than the average harvested power and increases with the capacity of the energy buffer.

Connected through hyperedge HE-1 (induced by source paper "performance of energy buffer aided incremental relaying in cooperative networks"):
  with members:
    - "incremental accumulate then forward relaying in wireless energy harvesting cooperative networks"
    - "wireless powered communication networks an overview"
    - "performance of adaptive link selection with buffer aided relays in underlay cognitive networks"
    - "a discrete time switching protocol for wireless powered communications with energy accumulation"
    - "energy harvesting two hop communication networks"
    - "performance analysis of wireless powered communication with finite infinite energy storage"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"

Connected through hyperedge HE-2 (induced by source paper "performance analysis of energy buffer aided wireless powered communication"):
  with members:
    - "wireless powered communication networks an overview"
    - "resource allocation techniques for wireless powered communication networks with energy storage constraint"
    - "a discrete time switching protocol for wireless powered communications with energy accumulation"
    - "throughput maximization in wireless powered communication networks"
    - "on online energy harvesting in multiple access communication systems"
    - "wireless information and power transfer architecture design and rate energy tradeoff"

Connected through hyperedge HE-3 (induced by source paper "wireless power meets energy harvesting a joint energy allocation approach in ofdm based system"):
  with members:
    - "wireless powered communication opportunities and challenges"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"
    - "spatial throughput maximization of wireless powered communication networks"
    - "optimized training for net energy maximization in multi antenna wireless energy transfer over frequency selective channel"
    - "joint beamforming design and time allocation for wireless powered communication networks"
    - "user cooperation in wireless powered communication networks"
    - "optimal resource allocation in full duplex wireless powered communication network"
    - "energy beamforming with one bit feedback"

Connected through hyperedge HE-4 (induced by source paper "energy harvesting wireless sensor networks delay analysis considering energy costs of sensing and transmission"):
  with members:
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "cutting last wires for mobile communication by microwave power transfer"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "throughput maximization for the gaussian relay channel 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.IT(Information Theory)