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: "robust transceiver design for k pairs quasi static mimo interference channels via semi definite relaxation"
  Abstract: In this paper, we propose a robust transceiver design for the K-pair quasi-static MIMO interference channel. Each transmitter is equipped with M antennas, each receiver is equipped with N antennas, and the k-th transmitter sends L_k independent data streams to the desired receiver. In the literature, there exist a variety of theoretically promising transceiver designs for the interference channel such as interference alignment-based schemes, which have feasibility and practical limitations. In order to address practical system issues and requirements, we consider a transceiver design that enforces robustness against imperfect channel state information (CSI) as well as fair performance among the users in the interference channel. Specifically, we formulate the transceiver design as an optimization problem to maximize the worst-case signal-to-interference-plus-noise ratio among all users. We devise a low complexity iterative algorithm based on alternative optimization and semi-definite relaxation techniques. Numerical results verify the advantages of incorporating into transceiver design for the interference channel important practical issues such as CSI uncertainty and fairness performance.

Connected through hyperedge HE-1 (induced by source paper "robust transceiver design for reciprocal m n interference channel based on statistical linearization approximation"):
  with members:
    - "interference alignment with analog channel state feedback"
    - "interference alignment under limited feedback for mimo interference channels"
    - "interference alignment with limited feedback"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-2 (induced by source paper "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"):
  with members:
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "mimo interference alignment over correlated channels with imperfect csi"
    - "cooperative algorithms for mimo interference channels"
    - "power allocation games for mimo multiple access channels with coordination"

Connected through hyperedge HE-3 (induced by source paper "robust joint precoder and equalizer design in mimo communication systems"):
  with members:
    - "linear precoding and equalization for network mimo with partial cooperation"

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)