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 "how to achieve the optimal dmt of selective fading mimo channels"):
  Abstract: In this paper, we consider a particular class of selective fading channel corresponding to a channel that is selective either in time or in frequency. For this class of channel, we propose a systematic way to achieve the optimal DMT derived in Coronel and B\"olcskei, IEEE ISIT, 2007 by extending the non-vanishing determinant (NVD) criterion to the selective channel case. A new code construction based on split NVD parallel codes is then proposed to satisfy the NVD parallel criterion. This result is of significant interest not only in its own right, but also because it settles a long-standing debate in the literature related to the optimal DMT of selective fading channels.

Includes members:
  Member "noncoherent capacity of underspread fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference cancellation and iterative detection for orthogonal time frequency space modulation")
  Member "optimal diversity multiplexing tradeoff in selective fading mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diversity multiplexing tradeoff in selective fading multiple access mimo channels")
  Member "remarks on the criteria of constructing mimo mac dmt optimal codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an error event sensitive tradeoff between rate and coding gain in mimo mac")
  Member "diversity multiplexing tradeoff in selective fading mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the streaming dmt of fading channels")

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)