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 "reconstruction of correlated sources with energy harvesting constraints in delay constrained and delay tolerant communication scenarios"):
  Abstract: In this paper, we investigate the reconstruction of time-correlated sources in a point-to-point communications scenario comprising an energy-harvesting sensor and a Fusion Center (FC). Our goal is to minimize the average distortion in the reconstructed observations by using data from previously encoded sources as side information. First, we analyze a delay-constrained scenario, where the sources must be reconstructed before the next time slot. We formulate the problem in a convex optimization framework and derive the optimal transmission (i.e., power and rate allocation) policy. To solve this problem, we propose an iterative algorithm based on the subgradient method. Interestingly, the solution to the problem consists of a coupling between a two-dimensional directional water-filling algorithm (for power allocation) and a reverse water-filling algorithm (for rate allocation). Then we find a more general solution to this problem in a delay-tolerant scenario where the time horizon for source reconstruction is extended to multiple time slots. Finally, we provide some numerical results that illustrate the impact of delay and correlation in the power and rate allocation policies, and in the resulting reconstruction distortion. We also discuss the performance gap exhibited by a heuristic online policy derived from the optimal (offline) one.

Includes members:
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "a general utility optimization framework for energy harvesting based wireless communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cross layer scheduling and beamforming in smart grid powered cellular networks with heterogeneous energy coordination")
  Member "dynamic compression transmission for energy harvesting multihop networks with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission strategies for remote estimation with an energy harvesting sensor")
  Member "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "energy neutral source channel coding with battery and memory size constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guidelines for data analysis scripts")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "energy management policies for energy neutral source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic routing and scheduling policies for energy harvesting communication networks")
  Member "a general framework for the optimization of energy harvesting communication systems with battery imperfections":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")

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)