human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "optimal power control for transmitting correlated sources with energy harvesting constraints"):
  Abstract: We investigate the weighted-sum distortion minimization problem in transmitting two correlated Gaussian sources over Gaussian channels using two energy harvesting nodes. To this end, we develop offline and online power control policies to optimize the transmit power of the two nodes. In the offline case, we cast the problem as a convex optimization and investigate the structure of the optimal solution. We also develop a generalized water-filling based power allocation algorithm to obtain the optimal solution efficiently. For the online case, we quantify the distortion of the system using a cost function and show that the expected cost equals the expected weighted-sum distortion. Based on Banach's fixed point theorem, we further propose a geometrically converging algorithm to find the minimum cost via simple iterations. Simulation results show that our online power control outperforms the greedy power control where each node uses all the available energy in each slot and performs close to that of the proposed offline power control. Moreover, the performance of our offline power control almost coincides with the performance limit of the system.

Includes members:
  Member "optimized sensor collaboration for estimation of temporally correlated parameters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed sensing with orthogonal multiple access to code or not to code")
  Member "online learning schemes for power allocation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "near optimal energy control and approximate capacity of energy harvesting communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "the binary energy harvesting channel with a unit sized battery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "on online energy harvesting in multiple access communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "age minimal transmission for energy harvesting sensors with finite batteries online policies")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")

Question: Please tell me which class the source paper 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)