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: "the binary energy harvesting channel with a unit sized battery"
  Abstract: We consider a binary energy harvesting communication channel with a finite-sized battery at the transmitter. In this model, the channel input is constrained by the available energy at each channel use, which is driven by an external energy harvesting process, the size of the battery, and the previous channel inputs. We consider an abstraction where energy is harvested in binary units and stored in a battery with the capacity of a single unit, and the channel inputs are binary. Viewing the available energy in the battery as a state, this is a state-dependent channel with input-dependent states, memory in the states, and causal state information available at the transmitter only. We find an equivalent representation for this channel based on the timings of the symbols, and determine the capacity of the resulting equivalent timing channel via an auxiliary random variable. We give achievable rates based on certain selections of this auxiliary random variable which resemble lattice coding for the timing channel. We develop upper bounds for the capacity by using a genie-aided method, and also by quantifying the leakage of the state information to the receiver. We show that the proposed achievable rates are asymptotically capacity achieving for small energy harvesting rates. We extend the results to the case of ternary channel inputs. Our achievable rates give the capacity of the binary channel within 0.03 bits/channel use, the ternary channel within 0.05 bits/channel use, and outperform basic Shannon strategies that only consider instantaneous battery states, for all parameter values.

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"
    - "capacity analysis of discrete 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"

Connected through hyperedge HE-2 (induced by source paper "sending information through status updates"):
  with members:
    - "optimal status update for age of information minimization with an energy harvesting source"

Connected through hyperedge HE-3 (induced by source paper "optimal power control for transmitting correlated sources with energy harvesting constraints"):
  with members:
    - "optimized sensor collaboration for estimation of temporally correlated parameters"
    - "online learning schemes for power allocation in energy harvesting communications"
    - "energy harvesting wireless communications a review of recent advances"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "on online energy harvesting in multiple access communication systems"
    - "optimal energy allocation for wireless communications with energy harvesting constraints"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "estimation diversity and energy efficiency in distributed sensing"

Connected through hyperedge HE-4 (induced by source paper "can feedback increase the capacity of the energy harvesting channel"):
  with members:
    - "capacity of the energy harvesting channel with a finite battery"
    - "information networks with in block memory"
    - "binary energy harvesting channel with finite energy storage"
    - "awgn channel under time varying amplitude constraints with causal information at the transmitter"
    - "a coding theorem for a class of stationary channels with feedback"

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)