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 "performance of multi cell massive mimo systems with interference decoding"):
  Abstract: We consider a multi-cell massive MIMO system where a time-division duplex protocol is used to estimate the channel state information via uplink pilots. When maximum ratio combining (MRC) is used at the BSs, the re-use of pilots across cells causes the pilot contamination effect which yields interference components that do not vanish as the number of base-station (BS) antennas    $M \rightarrow \infty $   . When treating interference as noise (TIN), this phenomenon limits the performance of multi-cell massive MIMO systems. In this paper, we analyze more advanced schemes based on simultaneous unique decoding (SD) as well as simultaneous non-unique decoding (SND) of the interference that can provide unbounded rate as    $M \rightarrow \infty $   . We also establish a worst-case uncorrelated noise technique for multiple-access channels to derive achievable rate expressions for finite    $M$   . Furthermore, we study a much simpler subset of SND (called S-SND) which provides a lower bound to SND and achieves unbounded rate as    $M \rightarrow \infty $   , and also outperforms SD for finite    $M$   . For the special cases of two-cell and three-cell systems, using a maximum symmetric rate allocation policy we compare the performance of different interference decoding schemes with that of TIN. Finally, we numerically illustrate the improved performance of the proposed schemes.

Includes members:
  Member "large scale fading decoding in cellular massive mimo systems with spatially correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large scale fading precoding for maximizing the product of sinrs")
  Member "massive mimo has unlimited capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "gaussian multiple access via compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval over gaussian mac")
  Member "uplink interference reduction in large scale antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "power control in cellular massive mimo with varying user activity a deep learning solution")
  Member "joint power allocation and user association optimization for massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint power allocation and load balancing optimization for energy efficient cell free massive mimo networks")
  Member "robust pilot decontamination based on joint angle and power domain discrimination":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scalable cell free massive mimo systems")
  Member "optimal achievable rates for interference networks with random codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "homologous codes for multiple access channels")
  Member "system architecture and key technologies for 5g heterogeneous cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")

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)