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 scheduling for energy harvesting transmitters with hybrid energy storage"
  Abstract: We consider data transmission with an energy harvesting transmitter which has a hybrid energy storage unit composed of a perfectly efficient super-capacitor (SC) and an inefficient battery. The SC has finite space for energy storage while the battery has unlimited space. The transmitter can choose to store the harvested energy in the SC or in the battery. The energy is drained from the SC and the battery simultaneously. In this setting, we consider the offline throughput maximization problem by a deadline over a point-to-point channel. In contrast to previous works, the hybrid energy storage model with finite and unlimited storage capacities imposes a generalized set of constraints on the transmission policy. As such, we show that the solution generalizes that for a single battery and is obtained by applying directional water-filling algorithm multiple times.

Connected through hyperedge HE-1 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications"):
  with members:
    - "robust design of ac computing enabled receiver architecture for swipt networks"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "energy harvesting wireless communications a review of recent advances"
    - "delay optimal scheduling for energy harvesting based communications"
    - "capacity of fading gaussian channel with an energy harvesting sensor node"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "a general framework for the optimization of energy harvesting communication systems with battery imperfections"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

Connected through hyperedge HE-2 (induced by source paper "energy harvesting wireless communications a review of recent advances"):
  with members:
    - "renewable powered cellular networks energy field modeling and network coverage"
    - "dynamic compression transmission for energy harvesting multihop networks with correlated sources"
    - "constrained codes for joint energy and information transfer"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "spatial throughput of mobile ad hoc networks powered by energy harvesting"
    - "energy cooperation in energy harvesting communications"
    - "interactive joint transfer of energy and information"
    - "opportunistic wireless energy harvesting in cognitive radio networks"

Connected through hyperedge HE-3 (induced by source paper "cost minimization for fading channels with energy harvesting and conventional energy"):
  with members:
    - "full duplex wireless powered communication network with energy causality"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "energy efficient resource allocation in ofdma systems with hybrid energy harvesting base station"
    - "energy cooperation in cellular networks with renewable powered base stations"
    - "wireless information transfer with opportunistic energy harvesting"
    - "wireless information and power transfer architecture design and rate energy tradeoff"
    - "optimal save then transmit protocol for energy harvesting wireless transmitters"
    - "broadcasting with an energy harvesting rechargeable transmitter"

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)