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 "cascaded orthogonal space time block codes for wireless multi hop relay networks"):
  Abstract: Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more single antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes are used in cascade by the source and each relay stage. In the COSTBC, each relay stage separates the constellation symbols of the orthogonal space-time block code sent by the preceding relay stage using its CSI, and then transmits another orthogonal space-time block code to the next relay stage. COSTBCs are shown to achieve the maximum diversity gain in a multi-hop wireless network with flat Rayleigh fading channels. Several explicit constructions of COSTBCs are also provided for two-hop wireless networks with two and four source antennas and relay nodes. It is also shown that COSTBCs require minimum decoding complexity thanks to the connection to orthogonal space-time block codes.

Includes members:
  Member "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiplexing gain of amplify forward relaying in wireless multi antenna relay networks")
  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 "algebraic distributed space time codes with low ml decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noncoherent low decoding complexity space time codes for wireless relay networks")
  Member "diversity of mimo multihop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperation and underlay mode selection in cognitive radio network")
  Member "a non orthogonal distributed space time coded protocol part i signal model and design criteria":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed space time codes for cooperative networks with partial csi")
  Member "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximum rate of unitary weight single symbol decodable stbcs")
  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")
  Member "approximately universal optimality over several dynamic and non dynamic cooperative diversity schemes for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wireless coded caching a topological 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)