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 convex approximation approach to weighted sum rate maximization of multiuser miso interference channel under outage constraints"
  Abstract: This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weighted sum rate maximization problem is a nonconvex optimization problem and is difficult to solve. While it is possible to optimally deal with this problem in an exhaustive search manner by finding all the Pareto-optimal rate tuples in the (discretized) outage-constrained achievable rate region, this approach, however, suffers from a prohibitive computational complexity and is feasible only when the number of transmitter-receive pairs is small. In this paper, we propose a convex optimization based approximation method for efficiently handling the outage-constrained weighted sum rate maximization problem. The proposed approximation method consists of solving a sequence of convex optimization problems, and thus can be efficiently implemented by interior-point methods. Simulation results show that the proposed method can yield near-optimal solutions.

Connected through hyperedge HE-1 (induced by source paper "multicell coordinated beamforming with rate outage constraint part i complexity analysis"):
  with members:
    - "signal processing and optimal resource allocation for the interference channel"
    - "multicell coordinated beamforming with rate outage constraint part ii efficient approximation algorithms"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "achievable outage rate regions for the miso interference channel"
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"

Connected through hyperedge HE-2 (induced by source paper "low complexity delay constrained beamforming for multi user mimo systems with imperfect csit"):
  with members:
    - "solving pomdps by searching the space of finite policies"
    - "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"
    - "queue aware dynamic clustering and power allocation for network mimo systems via distributed stochastic learning"
    - "probabilistic sinr constrained robust transmit beamforming a bernstein type inequality based conservative approach"
    - "slow adaptive ofdma systems through chance constrained programming"

Connected through hyperedge HE-3 (induced by source paper "coordinated beamforming for multiuser miso interference channel under rate outage constraints"):
  with members:
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"

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)