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 "generic multiuser coordinated beamforming for underlay spectrum sharing"):
  Abstract: The beamforming techniques have been recently studied as possible enablers for underlay spectrum sharing. The existing beamforming techniques have several common limitations: they are usually system model specific, cannot operate with arbitrary number of transmit/receive antennas, and cannot serve arbitrary number of users. Moreover, the beamforming techniques for underlay spectrum sharing do not consider the interference originating from the incumbent primary system. This work extends the common underlay sharing model by incorporating the interference originating from the incumbent system into generic combined beamforming design that can be applied on interference, broadcast or multiple access channels. The paper proposes two novel multiuser beamforming algorithms for user fairness and sum rate maximization, utilizing newly derived convex optimization problems for transmit and receive beamformers calculation in a recursive optimization. Both beamforming algorithms provide efficient operation for the interference, broadcast and multiple access channels, as well as for arbitrary number of antennas and secondary users in the system. Furthermore, the paper proposes a successive transmit/receive optimization approach that reduces the computational complexity of the proposed recursive algorithms. The results show that the proposed complexity reduction significantly improves the convergence rates and can facilitate their operation in scenarios which require agile beamformers computation.

Includes members:
  Member "decomposition by partial linearization parallel optimization of multi agent systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convergent policy optimization for safe reinforcement learning")
  Member "transmit designs for the mimo broadcast channel with statistical csi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  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-3 (induced by source paper "mixed monotonic programming for fast global optimization")
  Member "mimo broadcasting for simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithm hardware co optimization of the memristor based framework for solving socp and homogeneous qcqp problems")
  Member "on gaussian mimo bc mac duality with multiple transmit covariance constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal precoder designs for sum utility maximization in swipt enabled multi user mimo cognitive radio networks")

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)