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 "resource allocation in green dense cellular networks complexity and algorithms"):
  Abstract: This paper studies the problem of user association, scheduling and channel allocation in dense cellular networks with energy harvesting base stations (EBSs). In this problem, the EBSs are powered solely by renewable energy and each user has a request for downloading data of certain size with a deadline constraint. The objective is to maximize the number of associated and scheduled users while allocating the available channels to the users and respecting the energy and deadline constraints. First, the computational complexity of this problem is characterized by studying its NP-hardness in different cases. Next, efficient algorithms are proposed in each case. The case of a single channel and a single EBS is solved using two polynomial-time optimal algorithms---one for arbitrary deadlines and a less-complex one for common deadlines. The case of a single channel and multiple EBSs is solved by proposing an efficient constant-factor approximation algorithm. The case of multiple channels is efficiently solved using a heuristic algorithm. Finally, our theoretical analysis is supplemented by simulation results to illustrate the performance of the proposed algorithms.

Includes members:
  Member "large scale spectrum allocation for cellular networks via sparse optimization":
    also connected through other hyperedges:
      (none)
  Member "optimal user scheduling in energy harvesting wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput maximization for full duplex wireless powered communication networks")
  Member "scalable spectrum allocation and user association in networks with many small cells":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "large scale spectrum allocation for cellular networks via sparse optimization")
  Member "boost base station on off switching strategy for energy efficient massive mimo hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic resource allocation and activity management for energy efficiency and fairness in heterogeneous networks")
  Member "online ski rental for on off scheduling of energy harvesting base stations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi agent meta reinforcement learning for self powered and sustainable edge computing systems")
  Member "online energy efficient packet scheduling for a common deadline with and without energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")
  Member "gate greening at the edges":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online ski rental for on off scheduling of energy harvesting base stations")
  Member "energy efficient cell activation user association and spectrum allocation in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reinforcement learning based vehicle cell association algorithm for highly mobile millimeter wave communication")

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)