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 "on the capacity and diversity multiplexing tradeoff of the two way relay channel"):
  Abstract: This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate region, when each relay employs an amplify and forward (AF) strategy. #R##N#The iterative algorithm solves a power minimization problem at every step, subject to minimum signal-to-interference-and-noise ratio constraints, which is non-convex, however, for which the Karush Kuhn Tuker conditions are sufficient for optimality. The optimal AF strategy assumes global channel state information (CSI) at each relay. To simplify the CSI requirements, a simple amplify and forward strategy, called dual channel matching, is also proposed, that requires only local channel state information, and whose achievable rate region is close to that of the optimal AF strategy. In the asymptotic regime of large number of relays, we show that the achievable rate region of the dual channel matching and an upper bound differ by only a constant term and establish the capacity scaling law of the two-way relay channel. Relay strategies achieving optimal diversity-multiplexing tradeoff are also considered with a single relay node. A compress and forward strategy is shown to be optimal for achieving diversity multiplexing tradeoff for the full-duplex case, in general, and for the half-duplex case in some cases.

Includes members:
  Member "approximate capacity of the two way relay channel a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "optimal beamforming for two way multi antenna relay channel with analogue network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "joint physical layer coding and network coding for bi directional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compute and forward relaying with ldpc codes over qpsk scheme")
  Member "the capacity of two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal beamforming for two way multi antenna relay channel with analogue network coding")
  Member "achievable rate regions for bi directional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation and outage analysis for an adaptive cognitive two way relay network")
  Member "physical network coding in two way wireless relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coherent detection for short packet physical layer network coding with fsk modulation")
  Member "performance bounds for bi directional coded cooperation protocols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "integer forcing and forward transceiver design for mimo multipair two way relaying")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "unmanned aerial vehicle assisted cellular communication")

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)