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 "awgn channel capacity of energy harvesting transmitters with a finite energy buffer"):
  Abstract: We consider an AWGN channel with a transmitter powered by an energy harvesting source. The node is equipped with a finite energy buffer. Such a system can be modelled as a channel with side information (about energy in the energy buffer) causally known at the transmitter. The receiver may or may not have the side information. We prove that Markov energy management policies are sufficient to achieve the capacity of the system and provide a single letter characterization for the capacity. The computation of the capacity is expensive. Therefore, we discuss an achievable scheme that is easy to compute. This achievable rate converges to the infinite buffer capacity as the buffer length increases.

Includes members:
  Member "energy management policies for energy neutral source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic routing and scheduling policies for energy harvesting communication networks")
  Member "information capacity of an energy harvesting sensor node":
    also connected through other hyperedges:
      (none)
  Member "capacity of fading gaussian channel with an energy harvesting sensor node":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "awgn channel under time varying amplitude constraints with causal information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities")
  Member "information capacity of energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resilient cyberphysical systems and their application drivers a technology roadmap")
  Member "basic performance limits and tradeoffs in energy harvesting sensor nodes with finite data and energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "information theoretic analysis of an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "diffusion based molecular communication with limited molecule production rate")

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)