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: "a decentralized method for joint admission control and beamforming in coordinated multicell downlink"
  Abstract: In cellular networks, admission control and beamforming optimization are intertwined problems. While beamforming optimization aims at satisfying users' quality-of-service (QoS) requirements or improving the QoS levels, admission control looks at how a subset of users should be selected so that the beamforming optimization problem can yield a reasonable solution in terms of the QoS levels provided. However, in order to simplify the design, the two problems are usually seen as separate problems. This paper considers joint admission control and beamforming (JACoB) under a coordinated multicell MISO downlink scenario. We formulate JACoB as a user number maximization problem, where selected users are guaranteed to receive the QoS levels they requested. The formulated problem is combinatorial and hard, and we derive a convex approximation to the problem. A merit of our convex approximation formulation is that it can be easily decomposed for per-base-station decentralized optimization, namely, via block coordinate decent. The efficacy of the proposed decentralized method is demonstrated by simulation results.

Connected through hyperedge HE-1 (induced by source paper "joint long term admission control and beamforming in green downlink networks offline and online approaches"):
  with members:
    - "joint power and admission control based on channel distribution information a novel two timescale approach"
    - "context aware mobility management in hetnets a reinforcement learning approach"
    - "joint power and admission control via linear programming deflation"
    - "distributed robust multicell coordinated beamforming with imperfect csi an admm approach"
    - "green cellular networks a survey some research issues and challenges"

Connected through hyperedge HE-2 (induced by source paper "joint power and admission control based on channel distribution information a novel two timescale approach"):
  with members:
    - "sample approximation based deflation approaches for chance sinr constrained joint power and admission control"
    - "joint power and admission control via linear programming deflation"

Connected through hyperedge HE-3 (induced by source paper "sample approximation based deflation approaches for chance sinr constrained joint power and admission control"):
  with members:
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "joint power and admission control via linear programming deflation"
    - "joint bandwidth and power allocation with admission control in wireless multi user networks with and without relaying"
    - "probabilistic sinr constrained robust transmit beamforming a bernstein type inequality based conservative approach"

Connected through hyperedge HE-4 (induced by source paper "backhaul limited asymmetric cooperation for mimo cellular networks via semidefinite relaxation"):
  with members:
    - "distributed multicell beamforming design approaching pareto boundary with max min fairness"
    - "a fast approach for overcomplete sparse decomposition based on smoothed ell 0 norm"
    - "networked mimo with clustered linear precoding"

Connected through hyperedge HE-5 (induced by source paper "joint power and admission control non convex l_q approximation and an effective polynomial time deflation approach"):
  with members:
    - "on the complexity of joint subcarrier and power allocation for multi user ofdma systems"
    - "complexity of unconstrained l_2 l_p minimization"

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)