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 "base station sleeping and resource allocation in renewable energy powered cellular networks"):
  Abstract: We consider energy-efficient wireless resource management in cellular networks where base stations (BSs) are equipped with energy harvesting devices, using statistical information for traffic intensity and renewable energy. The problem is formulated as adapting BSs' on-off states, active resource blocks (e.g., subcarriers), and renewable energy allocation to minimize the average grid power consumption while satisfying the users' quality of service (blocking probability) requirements. It is transformed into an unconstrained optimization problem to minimize a weighted sum of grid power consumption and blocking probability. A two-stage dynamic programming algorithm is proposed to solve this problem, by which the BSs' on-off states are optimized in the first stage, and the active BSs' resource blocks are allocated iteratively in the second stage. Compared with the optimal joint BSs' on-off states and active resource blocks allocation algorithm, the proposed algorithm greatly reduces the computational complexity and can achieve the optimal performance when the traffic is uniformly distributed.

Includes members:
  Member "finite horizon online lazy scheduling with energy harvesting transmitters over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "age minimal transmission for energy harvesting sensors with finite batteries online policies")
  Member "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "on the precoder design of a wireless energy harvesting node in linear vector gaussian channels with arbitrary input distribution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "planning of cellular networks enhanced by energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "comp meets smart grid a new communication and energy cooperation paradigm")
  Member "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes")
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback")
  Member "optimal utilization of a cognitive shared channel with a rechargeable primary source node":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wireless network level partial relay cooperation a stable throughput analysis")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")

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)