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 "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"):
  Abstract: In this paper, the outage probability and outage-based beam design for multiple-input multiple-output (MIMO) interference channels are considered. First, closed-form expressions for the outage probability in MIMO interference channels are derived under the assumption of Gaussian-distributed channel state information (CSI) error, and the asymptotic behavior of the outage probability as a function of several system parameters is examined by using the Chernoff bound. It is shown that the outage probability decreases exponentially with respect to the quality of CSI measured by the inverse of the mean square error of CSI. Second, based on the derived outage probability expressions, an iterative beam design algorithm for maximizing the sum outage rate is proposed. Numerical results show that the proposed beam design algorithm yields significantly better sum outage rate performance than conventional algorithms such as interference alignment developed under the assumption of perfect CSI.

Includes members:
  Member "coordinated beamforming for multiuser miso interference channel under rate outage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "mimo interference alignment over correlated channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the feasibility of interference alignment in compounded mimo broadcast channels with antenna correlation and mixed user classes")
  Member "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "robust transceiver design for k pairs quasi static mimo interference channels via semi definite relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust transceiver design for reciprocal m n interference channel based on statistical linearization approximation")
  Member "power allocation games for mimo multiple access channels with coordination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed power control with partial channel state information performance characterization and design")

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)