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: "can feedback increase the capacity of the energy harvesting channel"
  Abstract: We investigate if feedback can increase the capacity of an energy harvesting communication channel where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery communicates to a receiver over a memoryless channel. For a simple special case where the energy arrival process is deterministic and the channel is a BEC, we explicitly compute the feed-forward and feedback capacities and show that feedback can strictly increase the capacity of this channel. Building on this example, we also show that feedback can increase the capacity when the energy arrivals are i.i.d. known noncausally at the transmitter and the receiver.

Connected through hyperedge HE-1 (induced by source paper "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"):
  with members:
    - "asymptotics of input constrained erasure channel capacity"
    - "dual capacity upper bounds for noisy runlength constrained channels"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "capacity and coding for the ising channel with feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-2 (induced by source paper "capacity of burst noise erasure channels with and without feedback and input cost"):
  with members:
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "asymptotics of input constrained erasure channel capacity"
    - "feedback does not increase the capacity of compound channels with additive noise"
    - "zero delay sequential transmission of markov sources over burst erasure channels"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "capacity and coding for the ising channel with feedback"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"

Connected through hyperedge HE-3 (induced by source paper "capacity of remotely powered communication"):
  with members:
    - "asymptotics of input constrained erasure channel capacity"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy harvesting wireless communications a review of recent advances"
    - "capacity of the awgn channel with random battery recharges"
    - "universally near optimal online power control for energy harvesting nodes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "constrained codes for joint energy and information transfer"

Connected through hyperedge HE-4 (induced by source paper "capacity analysis of discrete energy harvesting channels"):
  with members:
    - "capacity of the energy harvesting channel with a finite battery"
    - "capacity of a post channel with and without feedback"
    - "a randomized approach to the capacity of finite state channels"
    - "binary energy harvesting channel with finite energy storage"
    - "awgn channel under time varying amplitude constraints with causal information at the transmitter"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "extension of the blahut arimoto algorithm for maximizing directed information"

Connected through hyperedge HE-5 (induced by source paper "capacity of the energy harvesting channel with a finite battery"):
  with members:
    - "capacity of the awgn channel with random battery recharges"
    - "universally near optimal online power control for energy harvesting nodes"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "on online energy harvesting in multiple access communication systems"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "binary energy harvesting channel with finite energy storage"
    - "capacity of fading gaussian channel with an energy harvesting sensor node"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

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)