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 "backing off from infinity performance bounds via concentration of spectral measure for random mimo channels"):
  Abstract: The performance analysis of random vector channels, particularly multiple-input-multiple-output (MIMO) channels, has largely been established in the asymptotic regime of large channel dimensions, due to the analytical intractability of characterizing the exact distribution of the objective performance metrics. This paper exposes a new non-asymptotic framework that allows the characterization of many canonical MIMO system performance metrics to within a narrow interval under moderate-to-large channel dimensionality, provided that these metrics can be expressed as a separable function of the singular values of the matrix. The effectiveness of our framework is illustrated through two canonical examples. Specifically, we characterize the mutual information and power offset of random MIMO channels, as well as the minimum mean squared estimation error of MIMO channel inputs from the channel outputs. Our results lead to simple, informative, and reasonably accurate control of various performance metrics in the finite-dimensional regime, as corroborated by the numerical simulations. Our analysis framework is established via the concentration of spectral measure phenomenon for random matrices uncovered by Guionnet and Zeitouni, which arises in a variety of random matrix ensembles irrespective of the precise distributions of the matrix entries.

Includes members:
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "bounds on the second order coding rate of the mimo rayleigh block fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coherent multiple antenna block fading channels at finite blocklength")
  Member "shannon meets nyquist capacity of sampled gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity of memoryless channels with sampled cyclostationary gaussian noise")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "on the distribution of mimo mutual information an in depth painleve based characterization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the exact distribution of mutual information of two user mimo mac based on quotient distribution of wishart matrices")
  Member "outage capacity for the optical mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gallager bound for mimo channels large n asymptotics")
  Member "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "achieving massive mimo spectral efficiency with a not so large number of antennas":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")

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)