human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "no downlink pilots are needed in tdd massive mimo"):
  with members:
    - "massive mimo ten myths and one critical question"
    - "performance analysis of massive mimo for cell boundary users"
    - "massive mimo performance evaluation based on measured propagation data"
    - "blind estimation of effective downlink channel gains in massive mimo"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "aspects of favorable propagation in massive mimo"
    - "massive mimo for next generation wireless systems"
    - "massive mu mimo downlink tdd systems with linear precoding and downlink pilots"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of bi static modulated re scatter systems"):
  with members:
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-3 (induced by source paper "outage capacity of rayleigh product channels a free probability approach"):
  with members:
    - "asymptotic capacity and optimal precoding in mimo multi hop relay networks"
    - "living at the edge a large deviations approach to the outage mimo capacity"
    - "asymptotic analysis of double scattering channels"
    - "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "diversity multiplexing tradeoff of double scattering mimo channels"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-4 (induced by source paper "on the outage capacity of orthogonal space time block codes over multi cluster scattering mimo channels"):
  with members:
    - "asymptotic capacity and optimal precoding in mimo multi hop relay networks"

Connected through hyperedge HE-5 (induced by source paper "performance of general stcs over spatially correlated mimo single keyhole channels"):
  with members:
    - "diversity multiplexing tradeoff of double scattering mimo channels"
    - "mimo diversity in the presence of double scattering"

Question: Please tell me which class the center node 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)