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: "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
  Abstract: This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional water-filling interpretations. Next, stochastic data arrivals are addressed. Finally online and/or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations.

Connected through hyperedge HE-1 (induced by source paper "age minimal online policies for energy harvesting sensors with random battery recharges"):
  with members:
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "sending information through status updates"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "status updates through multicast networks"
    - "energy harvesting networks with general utility functions near optimal online policies"
    - "timely updates over an erasure channel"
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"

Connected through hyperedge HE-2 (induced by source paper "energy harvesting networks with general utility functions near optimal online policies"):
  with members:
    - "finite horizon energy efficient scheduling with energy harvesting transmitters over fading channels"
    - "online power control optimization for wireless transmission with energy harvesting and storage"
    - "optimal offline and competitive online strategies for transmitter receiver energy harvesting"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "energy harvesting networks with energy cooperation procrastinating policies"
    - "universally near optimal online power control for energy harvesting nodes"
    - "energy harvesting broadband communication systems with processing energy cost"

Connected through hyperedge HE-3 (induced by source paper "near optimal online distortion minimization for energy harvesting nodes"):
  with members:
    - "optimal offline and competitive online strategies for transmitter receiver energy harvesting"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "source channel coding under energy delay and buffer constraints"
    - "energy harvesting networks with energy cooperation procrastinating policies"
    - "universally near optimal online power control for energy harvesting nodes"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "energy cooperation in energy harvesting communications"

Connected through hyperedge HE-4 (induced by source paper "energy harvesting communications under explicit and implicit temperature constraints"):
  with members:
    - "energy harvesting transmitters that heat up throughput maximization under temperature constraints"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "energy harvesting two hop communication networks"
    - "energy harvesting broadband communication systems with processing energy cost"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "on channels with action dependent states"

Connected through hyperedge HE-5 (induced by source paper "age minimization in energy harvesting communications energy controlled delays"):
  with members:
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "age minimal transmission in energy harvesting two hop networks"
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "two hop communication with energy harvesting"

Connected through hyperedge HE-6 (induced by source paper "age minimal transmission in energy harvesting two hop networks"):
  with members:
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "two hop communication with energy harvesting"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"

Connected through hyperedge HE-7 (induced by source paper "transmission game in mimo interference channels with radio frequency energy harvesting"):
  with members:
    - "information and energy cooperation in ofdm relaying protocols and optimization"
    - "collaborative wireless energy and information transfer in interference channel"
    - "multiuser miso beamforming for simultaneous wireless information and power transfer"
    - "wireless information and energy transfer in multi antenna interference channel"
    - "simultaneous information and power transfer for broadband wireless systems"
    - "wireless information and power transfer in multiuser ofdm systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information transfer with opportunistic energy harvesting"

Connected through hyperedge HE-8 (induced by source paper "capacity region of gaussian multiple access channels with energy harvesting and energy cooperation"):
  with members:
    - "simultaneous wireless information and power transfer in cooperative relay networks with rateless codes"
    - "optimum transmission policies for energy harvesting sensor networks powered by a mobile control center"
    - "energy harvesting networks with energy cooperation procrastinating policies"
    - "wireless information and energy transfer for two hop non regenerative mimo ofdm relay networks"
    - "outage probability of energy harvesting relay aided cooperative networks over rayleigh fading channel"
    - "energy cooperation in energy harvesting communications"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

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)