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: "non convex utility maximization in gaussian miso broadcast and interference channels"
  Abstract: Utility (e.g., sum-rate) maximization for multiantenna broadcast and interference channels (with one antenna at the receivers) is known to be in general a non-convex problem, if one limits the scope to linear (beamforming) strategies at transmitter and receivers. In this paper, it is shown that, under some standard assumptions, most notably that the utility function is decreasing with the interference levels at the receivers, a global optimal solution can be found with reduced complexity via a suitably designed Branch-and-Bound method. Although infeasible for real-time implementation, this procedure enables a non-heuristic and systematic assessment of suboptimal techniques. A suboptimal strategy is then proposed that, when applied to sum-rate maximization, reduces to the well-known distributed pricing techniques. Finally, numerical results are provided that compare global optimal solutions with suboptimal (pricing) techniques for sum-rate maximization problems, leading to insight into issues such as the robustness against bad initializations.

Connected through hyperedge HE-1 (induced by source paper "efficient global optimal resource allocation in non orthogonal interference networks"):
  with members:
    - "optimization of weighted individual energy efficiencies in interference networks"
    - "distributed optimization for coordinated beamforming in multicell multigroup multicast systems power minimization and sinr balancing"
    - "energy efficient beam coordination strategies with rate dependent processing power"
    - "energy efficient power control a look at 5g wireless technologies"
    - "optimal achievable rates for interference networks with random codes"
    - "resource allocation for energy efficient 3 way relay channels"
    - "instantaneous relaying for the 3 way relay channel with circular message exchanges"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"

Connected through hyperedge HE-2 (induced by source paper "distributed asynchronous optimization framework for the miso interference channel"):
  with members:
    - "robust monotonic optimization framework for multicell miso systems"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"
    - "on the optimality of beamforming for multi user miso interference channels with single user detection"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-3 (induced by source paper "robust monotonic optimization framework for multicell miso systems"):
  with members:
    - "robust linear precoder design for multi cell downlink transmission"
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "probabilistic sinr constrained robust transmit beamforming a bernstein type inequality based conservative approach"
    - "multi cell mimo downlink with fairness criteria the large system limit"
    - "cooperative interference management with miso beamforming"
    - "fairness in multiuser systems with polymatroid capacity region"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

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)