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 "d mg tradeoff of df and af relaying protocols over asynchronous pam cooperative networks"):
  Abstract: The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as non-orthogonal selection decode-and-forward (NSDF), orthogonal selection decode-and-forward (OSDF), non-orthogonal amplify-and-forward (NAF), and orthogonal amplify-and-forward (OAF). The transmitter nodes are assumed to send pulse amplitude modulation (PAM) signals asynchronously, in which information symbols are linearly modulated by a shaping waveform to be sent to the destination. We consider two different cases with respect to the length of the shaping waveforms in the time domain. In the theoretical case where the shaping waveforms with infinite time support are used, it is shown that asynchronism does not affect the DMT performance of the system and the same DMT as that of the corresponding synchronous network is obtained for all the aforementioned protocols. In the practical case where finite length shaping waveforms are used, it is shown that better diversity gains can be achieved at the expense of bandwidth expansion. In the decode-and-forward (DF) type protocols, the asynchronous network provides better diversity gains than those of the corresponding synchronous network throughout the range of the multiplexing gain. In the amplify-and-forward (AF) type protocols, the asynchronous network provides the same DMT as that of the corresponding synchronous counterpart under the OAF protocol; however, a better diversity gain is achieved under the NAF protocol throughout the range of the multiplexing gain. In particular, in the single relay asynchronous network, the NAF protocol provides the same DMT as that of the 2 {\times} 1 multiple-input single-output (MISO) channel.

Includes members:
  Member "ofdm based distributed space time coding for asynchronous relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "differential distributed space time coding with imperfect synchronization in frequency selective channels")
  Member "diversity multiplexing tradeoff of asynchronous cooperative diversity in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asynchronous interference alignment")
  Member "d mg tradeoff and optimal codes for a class of af and df cooperative communication protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a trellis coded modulation scheme for the fading relay channel")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")
  Member "perfect space time codes with minimum and non minimum delay for any number of antennas":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding")

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)