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: "multicell coordinated beamforming with rate outage constraint part ii efficient approximation algorithms"
  Abstract: This paper studies the coordinated beamforming (CoBF) design for the multiple-input single-output interference channel, provided that only channel distribution information is known to the transmitters. The problem under consideration is a probabilistically constrained optimization problem which maximizes a predefined system utility subject to constraints on rate outage probability and power budget of each transmitter. Our recent analysis has shown that the outage-constrained CoBF problem is intricately difficult, e.g., NP-hard. Therefore, the focus of this paper is on suboptimal but computationally efficient algorithms. Specifically, by leveraging on the block successive upper bound minimization (BSUM) method in optimization, we propose a Gauss-Seidel type algorithm, called distributed BSUM algorithm, which can handle differentiable, monotone and concave system utilities. By exploiting a weighted minimum mean-square error (WMMSE) reformulation, we further propose a Jocobi-type algorithm, called distributed WMMSE algorithm, which can optimize the weighted sum rate utility in a fully parallel manner. To provide a performance benchmark, a relaxed approximation method based on polyblock outer approximation is also proposed. Simulation results show that the proposed algorithms are significantly superior to the existing successive convex approximation method in both performance and computational efficiency, and can yield promising approximation performance.

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"
    - "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"
    - "optimal beamforming in interference networks with perfect local channel information"

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)