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 "from multi keyholes to measure of correlation and power imbalance in mimo channels outage capacity analysis"):
  Abstract: An information-theoretic analysis of a multi-keyhole channel, which includes a number of statistically independent keyholes with possibly different correlation matrices, is given. When the number of keyholes or/and the number of Tx/Rx antennas is large, there is an equivalent Rayleigh-fading channel such that the outage capacities of both channels are asymptotically equal. In the case of a large number of antennas and for a broad class of fading distributions, the instantaneous capacity is shown to be asymptotically Gaussian in distribution, and compact, closed-form expressions for the mean and variance are given. Motivated by the asymptotic analysis, a simple, full-ordering scalar measure of spatial correlation and power imbalance in MIMO channels is introduced, which quantifies the negative impact of these two factors on the outage capacity in a simple and well-tractable way. It does not require the eigenvalue decomposition, and has the full-ordering property. The size-asymptotic results are used to prove Telatar's conjecture for semi-correlated multi-keyhole and Rayleigh channels. Since the keyhole channel model approximates well the relay channel in the amplify-and-forward mode in certain scenarios, these results also apply to the latter.

Includes members:
  Member "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels")
  Member "diversity multiplexing tradeoff and outage probability in mimo relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems")
  Member "diversity multiplexing tradeoff via asymptotic analysis of large mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "outage exponent a unified performance metric for parallel fading channels")
  Member "on the capacity of doubly correlated mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exact statistical characterization of 2 times2 gram matrices with arbitrary variance profile")
  Member "mimo diversity in the presence of double scattering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)