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 "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.

Includes members:
  Member "pareto characterization of the multicell mimo performance region with simple receivers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear transceiver optimization in multicell mimo based on the generalized benders decomposition")
  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-2 (induced by source paper "mixed monotonic programming for fast global optimization")
  Member "optimal beamforming in interference networks with perfect local channel information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "heterogeneous multi tier networks improper signaling for joint rate energy optimization")
  Member "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "optimal distributed beamforming for miso interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiuser wirelessly powered backscatter communications nonlinearity waveform design and sinr energy tradeoff")
  Member "balancing egoism and altruism on the interference channel the mimo case":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "cooperative interference management with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "intelligent reflecting surface aided multiple access capacity region and deployment strategy")
  Member "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algorithm hardware co optimization of the memristor based framework for solving socp and homogeneous qcqp problems")

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)