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 offline broadcast scheduling with an energy harvesting transmitter"
  Abstract: We consider an energy harvesting transmitter broadcasting data to two receivers. Energy and data arrivals are assumed to occur at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving within a certain time window, using the energy that becomes available during this time. An achievable rate region with structural properties satisfied by the two-user AWGN BC capacity region is assumed. Structural properties of power and rate allocation in an optimal policy are established, as well as the uniqueness of the optimal policy under the condition that all the data of the "weaker" user are available at the beginning. An iterative algorithm, DuOpt, based on block coordinate descent that achieves the same structural properties as the optimal is described. Investigating the ways to have the optimal schedule of two consecutive epochs in terms of energy efficiency and minimum transmission duration, it has been shown that DuOpt achieves best performance under the same special condition of uniqueness.

Connected through hyperedge HE-1 (induced by source paper "finite horizon energy efficient scheduling with energy harvesting transmitters over fading channels"):
  with members:
    - "channel sensing and communication over a time correlated channel with an energy harvesting transmitter"
    - "a general utility optimization framework for energy harvesting based wireless communications"
    - "universally near optimal online power control for energy harvesting nodes"
    - "finite horizon online lazy scheduling with energy harvesting transmitters over fading channels"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "throughput maximization for an energy harvesting communication system with processing cost"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

Connected through hyperedge HE-2 (induced by source paper "optimal offline and competitive online strategies for transmitter receiver energy harvesting"):
  with members:
    - "finite horizon optimal transmission policies for energy harvesting sensors"
    - "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "optimal energy management policies for energy harvesting sensor nodes"

Connected through hyperedge HE-3 (induced by source paper "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"):
  with members:
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "convex separable problems with linear constraints in signal processing and communications"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "energy cooperation in energy harvesting communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "optimal scheduling and power allocation for two hop energy harvesting communication systems"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "training optimization for energy harvesting communication systems"

Connected through hyperedge HE-4 (induced by source paper "minimization of transmission duration of data packets over an energy harvesting fading channel"):
  with members:
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "capacity of fading gaussian channel with an energy harvesting sensor node"
    - "information capacity of energy harvesting sensor nodes"
    - "optimal packet scheduling in an energy harvesting communication system"

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)