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 "message passing algorithm for distributed downlink regularized zero forcing beamforming with cooperative base stations"):
  Abstract: Base station (BS) cooperation can turn unwanted interference to useful signal energy for enhancing system performance. In the cooperative downlink, zero-forcing beamforming (ZFBF) with a simple scheduler is well known to obtain nearly the performance of the capacity-achieving dirty-paper coding. However, the centralized ZFBF approach is prohibitively complex as the network size grows. In this paper, we devise message passing algorithms for realizing the regularized ZFBF (RZFBF) in a distributed manner using belief propagation. In the proposed methods, the overall computational cost is decomposed into many smaller computation tasks carried out by groups of neighboring BSs and communications is only required between neighboring BSs. More importantly, some exchanged messages can be computed based on channel statistics rather than instantaneous channel state information, leading to significant reduction in computational complexity. Simulation results demonstrate that the proposed algorithms converge quickly to the exact RZFBF and much faster compared to conventional methods.

Includes members:
  Member "joint beamforming and power control in coordinated multicell max min duality effective network and large system transition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "large system analysis of cooperative multi cell downlink transmission via regularized channel inversion with imperfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance of network assisted full duplex for cell free massive mimo")
  Member "channel hardening exploiting message passing chemp receiver in large scale mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "secrecy sum rates for multi user mimo regularized channel inversion precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "a deterministic equivalent for the analysis of non gaussian correlated mimo multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  Member "asymptotic moments for interference mitigation in correlated fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "max min sinr in large scale single cell mu mimo asymptotic analysis and low complexity transceivers")
  Member "the dynamics of message passing on dense graphs with applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "base station cooperation on the downlink large system analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "large scale beamforming for massive mimo via randomized sketching")

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)