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 "multicell coordinated beamforming with rate outage constraint part i complexity analysis"):
  Abstract: This paper studies the coordinated beamforming (CoBF) design in the multiple-input single-output interference channel, assuming only channel distribution information given a priori at the transmitters. The CoBF design is formulated as an optimization problem that maximizes a predefined system utility, e.g., the weighted sum rate or the weighted max-min-fairness (MMF) rate, subject to constraints on the individual probability of rate outage and power budget. While the problem is non-convex and appears difficult to handle due to the intricate outage probability constraints, so far it is still unknown if this outage constrained problem is computationally tractable. To answer this, we conduct computational complexity analysis of the outage constrained CoBF problem. Specifically, we show that the outage constrained CoBF problem with the weighted sum rate utility is intrinsically difficult, i.e., NP-hard. Moreover, the outage constrained CoBF problem with the weighted MMF rate utility is also NP-hard except the case when all the transmitters are equipped with single antenna. The presented analysis results confirm that efficient approximation methods are indispensable to the outage constrained CoBF problem.

Includes members:
  Member "signal processing and optimal resource allocation for the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one bit over the air aggregation for communication efficient federated edge learning design and convergence analysis")
  Member "multicell coordinated beamforming with rate outage constraint part ii efficient approximation algorithms":
    also connected through other hyperedges:
      (none)
  Member "coordinated beamforming for multiuser miso interference channel under rate outage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "achievable outage rate regions for the miso interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stable throughput region of the two user interference channel")
  Member "pareto characterization of the multicell mimo performance region with simple receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear transceiver optimization in multicell mimo based on the generalized benders decomposition")
  Member "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beamforming optimization for physical layer security in miso wireless networks")
  Member "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mixed monotonic programming for fast global optimization")
  Member "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multiple antenna technologies for beyond 5g")

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)