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: "on the pareto optimal beam structure and design for multi user mimo interference channels"
  Abstract: In this paper, the Pareto-optimal beam structure for multi-user multiple-input multiple-output (MIMO) interference channels is investigated and a necessary condition for any Pareto-optimal transmit signal covariance matrix is presented for the K-pair Gaussian MIMO interference channel. It is shown that any Pareto-optimal transmit signal covariance matrix at a transmitter should have its column space contained in the union of the signal spaces of the channel matrices from the transmitter to all receivers. Based on this necessary condition, an efficient parameterization for the beam search space is proposed. The proposed parameterization is given by the product manifold of a Stiefel manifold and a subset of a hyperplane and enables us to construct an efficient beam design algorithm by exploiting its rich geometrical structure and existing tools for optimization on Stiefel manifolds. Reduction in the beam search space dimension and computational complexity by the proposed parameterization and the proposed beam design approach is significant when the number of transmit antennas is much larger than the sum of the numbers of receive antennas, as in upcoming cellular networks adopting massive MIMO technologies. Numerical results validate the proposed parameterization and the proposed cooperative beam design method based on the proposed parameterization for MIMO interference channels.

Connected through hyperedge HE-1 (induced by source paper "linear transceiver optimization in multicell mimo based on the generalized benders decomposition"):
  with members:
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "the mimo iterative waterfilling algorithm"

Connected through hyperedge HE-2 (induced by source paper "alternating rate profile optimization in single stream mimo interference channels"):
  with members:
    - "pareto boundary of the rate region for single stream mimo interference channels linear transceiver design"
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"
    - "linear transceiver design for a mimo interfering broadcast channel achieving max min fairness"
    - "cooperative algorithms for mimo interference channels"
    - "optimal distributed beamforming for miso interference channels"
    - "balancing egoism and altruism on the interference channel the mimo case"
    - "cooperative interference management with miso beamforming"

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)