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 "capacity scaling of massive mimo in strong spatial correlation regimes"):
  Abstract: This paper investigates the capacity scaling of multicell massive MIMO systems in the presence of spatially correlated fading. In particular, we focus on the strong spatial correlation regimes where the covariance matrix of each user channel vector has a rank that scales sublinearly with the number of base station antennas, as the latter grows to infinity. We also consider the case where the covariance eigenvectors corresponding to the non-zero eigenvalues span randomly selected subspaces. For this channel model, referred to as the "random sparse angular support" model, we characterize the asymptotic capacity scaling law in the limit of large number of antennas. To achieve the asymptotic capacity results, statistical spatial despreading based on the second-order channel statistics plays a pivotal role in terms of pilot decontamination and interference suppression. A remarkable result is that even when the number of users scales linearly with base station antennas, a linear growth of the capacity with respect to the number of antennas is achievable under the sparse angular support model. We note that the achievable rate lower bound based on massive MIMO "channel hardening", widely used in the massive MIMO literature, yields rather loose results in the strong spatial correlation regimes and may significantly underestimate the achievable rate of massive MIMO. This work therefore considers an alternative bounding technique which is better suited to the strong correlation regimes. In fading channels with sparse angular support, it is further shown that spatial despreading (spreading) in uplink (downlink) has a more prominent impact on the performance of massive MIMO than channel hardening.

Includes members:
  Member "massive mimo has unlimited capacity":
    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 "massive mimo pilot decontamination and channel interpolation via wideband sparse channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint activity detection and channel estimation for mmw thz wideband massive access")
  Member "on the miso channel with feedback can infinitely massive antennas achieve infinite capacity":
    also connected through other hyperedges:
      (none)
  Member "on the ergodic rate lower bounds with applications to massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "on the role of transmit correlation diversity in multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "uplink analysis of large mu mimo systems with space constrained arrays in ricean fading")
  Member "robust pilot decontamination based on joint angle and power domain discrimination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")
  Member "hybrid beamforming for massive mimo a survey":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "amplitude and phase estimation for absolute calibration of massive mimo front ends")
  Member "on the high snr capacity of the gaussian interference channel and new capacity bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity bounds for the k user gaussian interference channel")

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)