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: "pareto boundary of the rate region for single stream mimo interference channels linear transceiver design"
  Abstract: We consider a multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream per user is transmitted and each receiver treats interference as noise. The paper focuses on the open problem of computing the outermost boundary (so-called Pareto boundary-PB) of the achievable rate region under linear transceiver design. The Pareto boundary consists of the strict PB and non-strict PB. For the two user case, we compute the non-strict PB and the two ending points of the strict PB exactly. For the strict PB, we formulate the problem to maximize one rate while the other rate is fixed such that a strict PB point is reached. To solve this non-convex optimization problem which results from the hard-coupled two transmit beamformers, we propose an alternating optimization algorithm. Furthermore, we extend the algorithm to the multi-user scenario and show convergence. Numerical simulations illustrate that the proposed algorithm computes a sequence of well-distributed operating points that serve as a reasonable and complete inner bound of the strict PB compared with existing methods.

Connected through hyperedge HE-1 (induced by source paper "alternating rate profile optimization in single stream mimo interference channels"):
  with members:
    - "on the pareto optimal beam structure and design for multi user mimo interference channels"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on the pareto optimal beam structure and design for multi user mimo interference channels"):
  with members:
    - "alternating rate profile optimization in single stream mimo interference channels"
    - "coordinated beamforming with relaxed zero forcing the sequential orthogonal projection combining method and rate control"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "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)