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 "optimal energy and data routing in networks with energy cooperation"):
  Abstract: We consider the delay minimization problem in an energy harvesting communication network with energy cooperation. In this network, nodes harvest energy from nature to sustain the power needed for data transmission, and may transfer a portion of their harvested energies to neighboring nodes through energy cooperation. For fixed data and energy routing topologies, we determine the optimum data rates, transmit powers, and energy transfers, subject to flow and energy conservation constraints, to minimize the network delay. We start with a simplified problem where data flows are fixed and optimize energy management at each node for the case of a single energy harvest per node. This is tantamount to distributing each node’s available energy over its outgoing data links and energy transfers to neighboring nodes. For this case, with no energy cooperation, we show that each node should allocate more power to links with more noise and/or more data flow. In addition, when there is energy cooperation, our numerical results indicate that the energy is routed from nodes with lower data loads to nodes with higher data loads. We then extend this setting to the case of multiple energy harvests per node over time. In this case, we optimize each node’s energy management over its outgoing data links and its energy transfers to neighboring nodes, over multiple time slots. For this case, with no energy cooperation, we show that, for any given node, the sum of powers on the outgoing links over time is equal to the single-link optimal power over time. Finally, we consider the problem of joint flow control and energy management for the entire network. We determine the necessary conditions for joint optimality of a power control, energy transfer, and routing policy. We provide an iterative algorithm that updates the data flows, energy flows, and power distribution over outgoing data links sequentially. We show that this algorithm converges to a Pareto-optimal operating point.

Includes members:
  Member "joint energy and spectrum cooperation for cellular communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new relation between energy efficiency and spectral efficiency in wireless communications systems")
  Member "cost aware green cellular networks with energy and communication cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new relation between energy efficiency and spectral efficiency in wireless communications systems")
  Member "application of smart antenna technologies in simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simultaneous wireless information and power transfer for decode and forward multihop relay systems in energy constrained iot networks")
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "energy cooperation in cellular networks with renewable powered base stations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")
  Member "wireless information and power transfer architecture design and rate energy tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "enabling wireless power transfer in cellular networks architecture modeling and deployment":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")

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)