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 "joint long term admission control and beamforming in green downlink networks offline and online approaches"):
  Abstract: Admission control is an effective solution to managing a wireless network with a large user set. It dynamically rejects users in bad conditions, and thereby guarantees high quality-of-service (QoS) for the others. Unfortunately, a frequently-varying admissible user set requests remarkable power to continually re-establish the transmission link. Hence, we explore the stability of admissible user set, and formulate a joint long-term admission control and beamforming problem for a network with one multi-antenna base station (BS) and multiple single-antenna users. We consider the downlink transmission in a time period containing multiple time slices. By jointly optimizing the admissible users and the BS transmit beamformers in different time slices, we aim to minimize the total power cost, including not only the power for QoS guarantee, but also the power for user status switching. Due to the NP-hardness of the problem, we develop two (offline and online) algorithms to find some efficient suboptimal solutions. The offline algorithm requires all channel state information (CSI), and solves the admissible users and beamformers in different time slices in one shot, based on successive upper-bound minimization (SUM). To support real-time data transmission, we further design an alternating direction method of multipliers (ADMM)-based online algorithm, which outputs the admissible users and beamformers in different time slices successively, utilizing the previous admissible user set, the actual value of current CSI, and the distribution of future CSI. Simulations validate the performance of the two algorithms, and show that the online algorithm is an efficient practical alternative to the offline algorithm.

Includes members:
  Member "joint power and admission control based on channel distribution information a novel two timescale approach":
    also connected through other hyperedges:
      (none)
  Member "context aware mobility management in hetnets a reinforcement learning approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "machine learning for resource management in cellular and iot networks potentials current solutions and open challenges")
  Member "joint power and admission control via linear programming deflation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a d2d based protocol for ultra reliable wireless communications for industrial automation")
  Member "a decentralized method for joint admission control and beamforming in coordinated multicell downlink":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power and admission control based on channel distribution information a novel two timescale approach")
  Member "distributed robust multicell coordinated beamforming with imperfect csi an admm approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "green cellular networks a survey some research issues and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatial and temporal management of cellular hetnets with multiple solar powered drones")

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)