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 "on lossy joint source channel coding in energy harvesting communication systems"):
  Abstract: We study the problem of lossy joint source-channel coding in a single-user energy harvesting communication system with causal energy arrivals and the energy storage unit may have leakage. In particular, we investigate the achievable distortion in the transmission of a single source via an energy harvesting transmitter over a point-to-point channel. We consider an adaptive joint source-channel coding system, where the length of channel codewords varies based on the available battery charge. We first establish a lower bound on the achievable distortion. Then, as necessary conditions for local optimality, we obtain two coupled equations that determine the mismatch ratio between channel symbols and source symbols as well as the transmission power, both as functions of the battery charge. As examples of continuous and discrete sources, we consider Gaussian and binary sources respectively. For the Gaussian case, we obtain a closed-form expression for the mismatch factor in terms of the $Lambert W$ function, and show that an increasing transmission power policy results in a decreasing mismatch factor policy and vice versa. Finally, we numerically compare the performance of the adaptive mismatch factor scheme to the case of a constant mismatch factor.

Includes members:
  Member "source channel coding under energy delay and buffer constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "leveraging linear quadratic regulator cost and energy consumption for ultra reliable and low latency iot control systems")
  Member "dynamic compression transmission for energy harvesting multihop networks with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reconstruction of correlated sources with energy harvesting constraints in delay constrained and delay tolerant communication scenarios")
  Member "on online energy harvesting in multiple access communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "age minimal transmission for energy harvesting sensors with finite batteries online policies")
  Member "delay optimal scheduling for energy harvesting based communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "energy neutral source channel coding with battery and memory size constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "guidelines for data analysis scripts")
  Member "optimal strategies for communication and remote estimation with an energy harvesting sensor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal causal rate constrained sampling for a class of continuous markov processes")
  Member "energy management policies for energy neutral source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stochastic routing and scheduling policies for energy harvesting communication networks")

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)