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 "robust transceiver design for full duplex decode and forward relay assisted mimo systems"):
  Abstract: Robust transceiver design against unresolvable system uncertainties is of crucial importance for reliable communication. For instance, full-duplex communication suffers from such uncertainties when canceling the self-interference, since some residual self-interference (RSI) remains uncanceled due to imperfect channel knowledge. We consider a MIMO multi-hop system, where the source, the relay and the destination are equipped with multiple antennas. The considered decode-and-forward (DF) hybrid relay can operate in either half-duplex or full-duplex mode, and the mode changes adaptively depending on the RSI strength. We investigate a robust transceiver design problem, which maximizes the throughput rate of the worstcase RSI under the self-interference channel uncertainty bound constraint. The yielded problem turns out to be a non-convex optimization problem, where the non-convex objective is optimized over the cone of semidefinite matrices. Without loss of generality, we simplify the problem to the optimization over multiple scalar parameters using majorization theory. Furthermore, we propose an efficient algorithm to obtain a local optimal solution iteratively. Eventually, we obtain insights on the optimal antenna allocation at the relay input-frontend and output-frontend, for relay reception and transmission, respectively. Interestingly, given a number of antennas at the relay, the robustness improves if more antennas are allocated to reception than to transmission.

Includes members:
  Member "state space adaptive nonlinear self interference cancellation for full duplex communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust transceiver design for mimo decode and forward full duplex relay")
  Member "all digital self interference cancellation technique for full duplex systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "capacity of the gaussian two hop full duplex relay channel with residual self interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conditional capacity and transmit signal design for swipt systems with multiple nonlinear energy harvesting receivers")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "passive self interference suppression for full duplex infrastructure nodes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi objective antenna selection in a full duplex base station")
  Member "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust transceiver design for mimo decode and forward full duplex relay")
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "understanding the impact of phase noise on active cancellation in wireless full duplex":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust transceiver design for mimo decode and forward full duplex relay")

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)