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 "practical design for multiple antenna cognitive radio networks with coexistence constraint"):
  Abstract: In this paper we investigate the practical design for the multiple-antenna cognitive radio (CR) networks sharing the geographically used or unused spectrum. We consider a single cell network formed by the primary users (PU), which are half-duplex two-hop relay channels and the secondary users (SU) are single user additive white Gaussian noise channels. In addition, the coexistence constraint which requires PUs' coding schemes and rates unchanged with the emergence of SU, should be satisfied. The contribution of this paper are twofold. First, we explicitly design the scheme to pair the SUs to the existing PUs in a single cell network. Second, we jointly design the nonlinear precoder, relay beamformer, and the transmitter and receiver beamformers to minimize the sum mean square error of the SU system. In the first part, we derive an approximate relation between the relay ratio, chordal distance and strengths of the vector channels, and the transmit powers. Based on this relation, we are able to solve the optimal pairing between SUs and PUs efficiently. In the second part, considering the feasibility of implementation, we exploit the Tomlinson-Harashima precoding instead of the dirty paper coding to mitigate the interference at the SU receiver, which is known side information at the SU transmitter. To complete the design, we first approximate the optimization problem as a convex one. Then we propose an iterative algorithm to solve it with CVX. This joint design exploits all the degrees of design. To the best of our knowledge, both the two parts have never been considered in the literature. Numerical results show that the proposed pairing scheme outperforms the greedy and random pairing with low complexity. Numerical results also show that even if all the channel matrices are full rank, under which the simple zero forcing scheme is infeasible, the proposed scheme can still work well.

Includes members:
  Member "cooperative cognitive networks optimal distributed and low complexity algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "all cognitive mimo a new multiuser detection approach with different priorities")
  Member "improved transmission strategies for cognitive radio under the coexistence constraint":
    also connected through other hyperedges:
      (none)
  Member "inner and outer bounds for the gaussian cognitive interference channel and new capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "optimal and robust transmit designs for miso channel secrecy by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noma an information theoretic perspective")
  Member "cognitive radio with partial channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the fast fading multiple antenna gaussian broadcast channel with confidential messages and partial csit")
  Member "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal precoder designs for sum utility maximization in swipt enabled multi user mimo cognitive radio networks")
  Member "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cognitive radio networks an information theoretic perspective")

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)