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 "fundamental asymptotic behavior of two user distributed massive mimo"):
  Abstract: This paper considers the uplink of a distributed Massive MIMO network where $N$ base stations (BSs), each equipped with $M$ antennas, receive data from $K=2$ users. We study the asymptotic spectral efficiency (as $M\to \infty$) with spatial correlated channels, pilot contamination, and different degrees of channel state information (CSI) and statistical knowledge at the BSs. By considering a two-user setup, we can simply derive fundamental asymptotic behaviors and provide novel insights into the structure of the optimal combining schemes. In line with [1], when global CSI is available at all BSs, the optimal minimum-mean squared error combining has an unbounded capacity as $M\to \infty$, if the global channel covariance matrices of the users are asymptotically linearly independent. This result is instrumental to derive a suboptimal combining scheme that provides unbounded capacity as $M\to \infty$ using only local CSI and global channel statistics. The latter scheme is shown to outperform a generalized matched filter scheme, which also achieves asymptotic unbounded capacity by using only local CSI and global channel statistics, but is derived following [2] on the basis of a more conservative capacity bound.

Includes members:
  Member "covariance matrix estimation for massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scalable cell free massive mimo systems")
  Member "a bilinear equalizer for massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "large scale fading precoding for maximizing the product of sinrs")
  Member "covariance matrix estimation in massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scalable cell free massive mimo systems")
  Member "massive mimo has unlimited capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "joint activity detection and channel estimation for mmw thz wideband massive access")
  Member "massive mimo with imperfect channel covariance information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scalable cell free massive mimo systems")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")

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)