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 "capacity of remotely powered communication"):
  Abstract: Motivated by recent developments in wireless power transfer, we study communication with a remotely powered transmitter. We propose an information-theoretic model where a charger can dynamically decide on how much power to transfer to the transmitter based on its side information regarding the communication, while the transmitter needs to dynamically adopt its coding strategy to its instantaneous energy state, which in turn depends on the actions previously taken by the charger. We characterize the capacity as n-letter mutual information rate under various levels of side information available at the charger. In some special cases, motivated by different settings of practical interest, we simplify these expressions to single-letter form, or provide an algorithm to efficiently compute capacity using dynamic programming. Our results provide some surprising insights on how side information at the charger can be used to increase the overall capacity of the system.

Includes members:
  Member "asymptotics of input constrained erasure channel capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computable lower bounds for capacities of input driven finite state channels")
  Member "capacity of the energy harvesting channel with a finite battery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  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 "can feedback increase the capacity of the energy harvesting channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "feedback capacity and coding for the bibo channel with a no repeated ones input constraint")
  Member "capacity of the awgn channel with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non asymptotic achievable rates for energy harvesting channels using save and transmit")
  Member "universally near optimal online power control for energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "subblock constrained codes for real time simultaneous energy and information transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rate control for wireless powered communication network with reliability and delay constraints")
  Member "near optimal energy control and approximate capacity of energy harvesting communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a maximin optimal online power control policy for energy harvesting 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)