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 "signaling design of two way mimo full duplex channel optimality under imperfect transmit front end chain"):
  Abstract: We derive the optimal signaling for a multiple input multiple output (MIMO) full-duplex two-way channel under the imperfect transmit front-end chain. We characterize the two-way rates of the channel by using a game-theoretical approach, where we focus on the Pareto boundary of the achievable rate region and Nash equilibia (NE). For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we quantify gains in the achievable rates of the proposed beamforming over the zero-forcing beamforming. For a general MIMO full-duplex channel, we establish the existence of NE and present a condition for the uniqueness of NE. We then propose an iterative water-filling algorithm which is capable of reaching NE. Through simulations the threshold of the self-interference level is found, below which the full-duplex NE outperforms the half-duplex TDMA.

Includes members:
  Member "energy efficient power control a look at 5g wireless technologies":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "hardware impairments aware transceiver for full duplex massive mimo relaying":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intelligent reflecting surface enhanced wireless network two timescale beamforming optimization")
  Member "optimal signaling of miso full duplex two way wireless channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable sum rates of half and full duplex bidirectional ofdm communication links")
  Member "coalitional games for transmitter cooperation in mimo multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "designing virus resistant high performance networks a game formation approach")
  Member "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "understanding the impact of phase noise on active cancellation in wireless full duplex":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "the capacity of mimo channels with per antenna power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mimo capacity with average total and per antenna power constraints")

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)