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 "joint user grouping and linear virtual beamforming complexity algorithms and approximation bounds"):
  Abstract: In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting a subset of nodes from potentially a large number of candidates to form a virtual multi-antenna system, while at the same time designing their joint linear transmission strategies. We focus on two specific application scenarios: 1) multiple single antenna transmitters cooperatively transmit to a receiver; 2) a single transmitter transmits to a receiver with the help of a number of cooperative relays. We formulate the joint node selection and beamforming problems as cardinality constrained optimization problems with both discrete variables (used for selecting cooperative nodes) and continuous variables (used for designing beamformers). For each application scenario, we first characterize the computational complexity of the joint optimization problem, and then propose novel semi-definite relaxation (SDR) techniques to obtain approximate solutions. We show that the new SDR algorithms have a guaranteed approximation performance in terms of the gap to global optimality, regardless of channel realizations. The effectiveness of the proposed algorithms is demonstrated via numerical experiments.

Includes members:
  Member "an analytical framework for heterogeneous partial feedback design in heterogeneous multicell ofdma networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a distributed optimization framework for multi channel multi user small cell networks")
  Member "joint power and admission control via linear programming deflation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint long term admission control and beamforming in green downlink networks offline and online approaches")
  Member "linear precoding in cooperative mimo cellular networks with limited coordination clusters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic modeling and analysis of user centric network mimo systems")
  Member "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithm hardware co optimization of the memristor based framework for solving socp and homogeneous qcqp problems")
  Member "cooperative multi cell block diagonalization with per base station power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative downlink interference transmission and cancellation for cellular connected uav a divide and conquer approach")
  Member "networked mimo with clustered linear precoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing throughput performance in distributed mimo wi fi networks using deep reinforcement learning")

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)