human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "capacity analysis of discrete energy harvesting channels"
  Abstract: We study the channel capacity of a general discrete energy harvesting channel with a finite battery. Contrary to traditional communication systems, the transmitter of such a channel is powered by a device that harvests energy from a random exogenous energy source and has a finite-sized battery. As a consequence, at each transmission opportunity the system can only transmit a symbol whose energy is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is simultaneously random, instantaneous, and influenced by the full history of the inputs and the energy harvesting process. Furthermore, naturally, in such a channel the energy information is observed causally at the transmitter. Both of these characteristics pose great challenges for the analysis of the channel capacity. In this work we use techniques developed for channels with side information and finite state channels, to obtain lower and upper bounds on the capacity of energy harvesting channels. In particular, in a general case with Markov energy harvesting processes we use stationarity and ergodicity theory to compute and optimize the achievable rates for the channels, and derive series of computable capacity upper and lower bounds.

Connected through hyperedge HE-1 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit"):
  with members:
    - "on achievable rates of awgn energy harvesting channels with block energy arrival and non vanishing error probabilities"
    - "online power control for block i i d energy harvesting channels"
    - "finite blocklength achievable rates for energy harvesting awgn channels with infinite buffer"
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "capacity of the energy harvesting channel with a finite battery"
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "the binary energy harvesting channel with a unit sized battery"

Connected through hyperedge HE-2 (induced by source paper "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "capacity region of gaussian multiple access channels with energy harvesting and energy cooperation"
    - "capacity of the energy harvesting gaussian mac"
    - "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost"
    - "weighted sum transmit power minimization for full duplex system with swipt and self energy recycling"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy recycling full duplex radios for next generation networks"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

Connected through hyperedge HE-3 (induced by source paper "online power control for block i i d energy harvesting channels"):
  with members:
    - "communication over a time correlated channel with an energy harvesting transmitter"
    - "on achievable rates of awgn energy harvesting channels with block energy arrival and non vanishing error probabilities"
    - "capacity of the energy harvesting gaussian mac"
    - "capacity of the energy harvesting channel with a finite battery"
    - "universally near optimal online power control for energy harvesting nodes"
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "on online energy harvesting in multiple access communication systems"

Question: Please tell me which class the center node 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)