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 "information theoretic analysis of an energy harvesting communication system"):
  Abstract: In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consumption. Transmission is interrupted if there is not sufficient energy. We address communication with such random energy arrivals in an information-theoretic setting. Based on the classical additive white Gaussian noise (AWGN) channel model, we study the coding problem with random energy arrivals at the transmitter. We show that the capacity of the AWGN channel with stochastic energy arrivals is equal to the capacity with an average power constraint equal to the average recharge rate. We provide two different capacity achieving schemes: save-and-transmit and best-effort-transmit. Next, we consider the case where energy arrivals have time-varying average in a larger time scale. We derive the optimal offline power allocation for maximum average throughput and provide an algorithm that finds the optimal power allocation.

Includes members:
  Member "optimal energy management policies for energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable rate of multi antenna wsrns with eh constraint in the presence of a jammer")
  Member "efficient energy management policies for networks with energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kalman prediction based proportional fair resource allocation for a solar powered wireless downlink")

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)