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 "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"):
  Abstract: Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR- > infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse . The SNR-asymptotic DMT overestimates the finite-SNR one . This paper outlines a number of additional limitations and difficulties of the DMT framework and discusses their implications. Using the recent results on the size-asymptotic (in the number of antennas) outage capacity distribution, the finite-SNR, size-asymptotic DMT is derived for a broad class of fading distributions. The SNR range over which the finite-SNR DMT is accurately approximated by the SNR-asymptotic one is characterized. The multiplexing gain definition is shown to affect critically this range and thus should be carefully selected, so that the SNR-asymptotic DMT is an accurate approximation at realistic SNR values and thus has operational significance to be used as a design criterion. The finite-SNR diversity gain is shown to decrease with correlation and power imbalance in a broad class of fading channels, and such an effect is described in a compact, closed form. Complete characterization of the outage probability (or outage capacity) requires not only the finite-SNR DMT, but also the SNR offset, which is introduced and investigated as well. This offset, which is not accounted for in the DMT framework, is shown to have a significant impact on the outage probability for a broad class of fading channels, especially when the multiplexing gain is small. The analytical results and conclusions are validated via extensive Monte Carlo simulations. Overall, the size-asymptotic DMT represents a valuable alternative to the SNR-asymptotic one.

Includes members:
  Member "diversity multiplexing tradeoff and outage probability in mimo relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "from multi keyholes to measure of correlation and power imbalance in mimo channels outage capacity analysis")
  Member "transmit diversity v spatial multiplexing in modern mimo systems":
    also connected through other hyperedges:
      (none)
  Member "diversity multiplexing tradeoff in selective fading mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the streaming dmt of fading channels")
  Member "diversity multiplexing tradeoff of double scattering mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic analysis of rzf over double scattering channels with mmse estimation")

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)