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: "broadcasting with an energy harvesting rechargeable transmitter"
  Abstract: In this paper, we investigate the transmission completion time minimization problem in an additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. The objective is to minimize the time by which all of the packets are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates in a deterministic setting. We first analyze the structural properties of the optimal transmission policy in a two-user broadcast channel via the dual problem of maximizing the departure region by a fixed time T. We prove that the optimal total transmit power sequence has the same structure as the optimal single-user transmit power sequence in . In addition, the total power is split optimally based on a cut-off power level; if the total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user; otherwise, all transmit power above this level is allocated to the weaker user. We then extend our analysis to an M-user broadcast channel. We show that the optimal total power sequence has the same structure as the two-user case and optimally splitting the total power among M users involves M-1 cut-off power levels. Using this structure, we propose an algorithm that finds the globally optimal policy. Our algorithm is based on reducing the broadcast channel problem to a single-user problem as much as possible. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.

Connected through hyperedge HE-1 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback"):
  with members:
    - "performance characterization using aoi in a single loop networked control system"
    - "the age of information in networks moments distributions and sampling"
    - "finite time distributed state estimation over time varying graphs exploiting the age of information"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "coded status updates in an energy harvesting erasure channel"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "sending information through status updates"
    - "stochastic control with stale information part i fully observable systems"

Connected through hyperedge HE-2 (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-3 (induced by source paper "coded status updates in an energy harvesting erasure channel"):
  with members:
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "timely updates over an erasure channel"
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "age minimization in energy harvesting communications energy controlled delays"
    - "age minimal transmission in energy harvesting two hop networks"
    - "update or wait how to keep your data fresh"
    - "energy harvesting transmitters that heat up throughput maximization under temperature constraints"

Connected through hyperedge HE-4 (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-5 (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-6 (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-7 (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"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "two hop communication with energy harvesting"

Connected through hyperedge HE-8 (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"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "two hop communication with energy harvesting"
    - "optimal energy allocation for wireless communications 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)