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 "end to end joint antenna selection strategy and distributed compress and forward strategy for relay channels"):
  Abstract: Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time codes were proposed to maximize the achievable diversity-multiplexing tradeoff, however, they fail to achieve all the points of the optimal diversity-multiplexing tradeoff. In the presence of a low-rate feedback link from the destination to each relay stage and the source, this paper proposes an end-to-end antenna selection (EEAS) strategy as an alternative to distributed space-time codes. The EEAS strategy uses a subset of antennas of each relay stage for transmission of the source signal to the destination with amplify and forwarding at each relay stage. The subsets are chosen such that they maximize the end-to-end mutual information at the destination. The EEAS strategy achieves the corner points of the optimal diversity-multiplexing tradeoff (corresponding to maximum diversity gain and maximum multiplexing gain) and achieves better diversity gain at intermediate values of multiplexing gain, versus the best known distributed space-time coding strategies. A distributed compress and forward (CF) strategy is also proposed to achieve all points of the optimal diversity-multiplexing tradeoff for a two-hop relay channel with multiple relay nodes.

Includes members:
  Member "to code or not to code in multi hop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable rate regions and outer bounds for a multi pair bi directional relay network")
  Member "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of the half duplex diamond channel")
  Member "nonregenerative mimo relaying with optimal transmit antenna selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sub modularity and antenna selection in mimo systems")
  Member "relay subset selection in wireless networks using partial decode and forward transmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized optimal two way relays subsets pairings in cloud based region cognitive networks")
  Member "diversity of mimo multihop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperation and underlay mode selection in cognitive radio network")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)