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: "communicating using an energy harvesting transmitter optimum policies under energy storage losses"
  Abstract: In this paper, short-term throughput optimal power allocation policies are derived for an energy harvesting transmitter with energy storage losses. In particular, the energy harvesting transmitter is equipped with a battery that loses a fraction of its stored energy. Both single user, i.e. one transmitter-one receiver, and the broadcast channel, i.e., one transmitter-multiple receiver settings are considered, initially with an infinite capacity battery. It is shown that the optimal policies for these models are threshold policies. Specifically, storing energy when harvested power is above an upper threshold, retrieving energy when harvested power is below a lower threshold, and transmitting with the harvested energy in between is shown to maximize the weighted sum-rate. It is observed that the two thresholds are related through the storage efficiency of the battery, and are nondecreasing during the transmission. The results are then extended to the case with finite battery capacity, where it is shown that a similar double-threshold structure arises but the thresholds are no longer monotonic. A dynamic program that yields an optimal online power allocation is derived, and is shown to have a similar double-threshold structure. A simpler online policy is proposed and observed to perform close to the optimal policy.

Connected through hyperedge HE-1 (induced by source paper "on lossy joint source channel coding in energy harvesting communication systems"):
  with members:
    - "source channel coding under energy delay and buffer constraints"
    - "dynamic compression transmission for energy harvesting multihop networks with correlated sources"
    - "on online energy harvesting in multiple access communication systems"
    - "delay optimal scheduling for energy harvesting based communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "energy neutral source channel coding with battery and memory size constraints"
    - "optimal strategies for communication and remote estimation with an energy harvesting sensor"
    - "energy management policies for energy neutral source channel coding"

Connected through hyperedge HE-2 (induced by source paper "weighted sum throughput maximization for mimo broadcast channel energy harvesting under system imperfection"):
  with members:
    - "convex separable problems with linear constraints in signal processing and communications"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "two hop communication with energy harvesting"
    - "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"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "information theoretic analysis of an energy harvesting communication system"

Connected through hyperedge HE-3 (induced by source paper "energy cooperation in energy harvesting communications"):
  with members:
    - "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"
    - "two way communication with energy exchange"
    - "throughput maximization for an energy harvesting communication system with processing cost"
    - "on the transfer of information and energy in multi user systems"
    - "enabling wireless power transfer in cellular networks architecture modeling and deployment"
    - "optimal transmission policies for energy harvesting two hop networks"

Connected through hyperedge HE-4 (induced by source paper "optimal scheduling for energy harvesting transmitters with hybrid energy storage"):
  with members:
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "throughput maximization for an energy harvesting communication system with processing cost"
    - "optimal save then transmit protocol for energy harvesting wireless transmitters"
    - "broadcasting with an energy harvesting rechargeable transmitter"
    - "sum rate optimal power policies for energy harvesting transmitters in an interference channel"
    - "two hop communication with energy harvesting"
    - "a general framework for the optimization of energy harvesting communication systems with battery imperfections"

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)