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: "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading"
  Abstract: We first consider an energy harvesting channel with fading, where only the transmitter harvests energy from natural sources. We bound the optimal long term throughput by a constant for a class of energy arrival distributions. The proposed method also gives a constant approximation to the capacity of the energy harvesting channel with fading. Next, we consider a more general system where both the transmitter and the receiver employ energy harvesting to power themselves. In this case, we show that finding an approximation to the optimal long term throughput is far more difficult, and identify a special case of unit battery capacity at both the transmitter and the receiver for which we obtain a universal bound on the ratio of the upper and lower bound on the long term throughput.

Connected through hyperedge HE-1 (induced by source paper "on distributed power control for uncoordinated dual energy harvesting links performance bounds and near optimal policies"):
  with members:
    - "optimal offline and competitive online strategies for transmitter receiver energy harvesting"
    - "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs"
    - "energy harvesting wireless communications a review of recent advances"
    - "outage minimization for a fading wireless link with energy harvesting transmitter and receiver"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "basic performance limits and tradeoffs in energy harvesting sensor nodes with finite data and energy storage"

Connected through hyperedge HE-2 (induced by source paper "energy management for energy harvesting wireless sensors with adaptive retransmission"):
  with members:
    - "outage minimization for a fading wireless link with energy harvesting transmitter and receiver"
    - "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "towards a communication theoretic understanding of system level power consumption"
    - "energy optimal transmission scheduling in wireless sensor networks"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-3 (induced by source paper "optimal offline and competitive online strategies for transmitter receiver energy harvesting"):
  with members:
    - "finite horizon optimal transmission policies for energy harvesting sensors"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system"
    - "optimal offline broadcast scheduling with an energy harvesting transmitter"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimum transmission policies for battery limited energy harvesting nodes"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "optimal energy management policies for energy harvesting sensor nodes"

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)