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 "a dynamic clustering algorithm for downlink comp systems with multiple antenna ues"):
  Abstract: Coordinated multi-point (CoMP) schemes have been widely studied in the recent years to tackle inter-cell interference. In practice, latency and throughput constraints on the backhaul allow the organization of only small clusters of base stations (BSs) where joint processing (JP) can be implemented. In this work, we focus on downlink CoMP-JP with multiple antenna user equipments (UEs) where the additional degrees of freedom are used to suppress the residual interference by using an interference rejection combiner (IRC) and allow a multi-stream transmission. The main contribution of this paper is the development of a novel dynamic BS clustering algorithm with corresponding UE scheduling. In particular, we first define a set of candidate BS clusters depending on long-term channel conditions. Then, in each time block, we develop a resource allocation scheme where: (a) for each candidate BS cluster, with corresponding scheduled UEs, a weighted sum rate is estimated and then (b) we select the set of non-overlapping BS clusters that maximizes the downlink system weighted sum rate. Numerical results show that much higher rates are achieved when UEs are equipped with multiple antennas and dynamic BS clustering is used.

Includes members:
  Member "a practical cooperative multicell mimo ofdma network based on rank coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond dirty paper coding for multi antenna broadcast channel with partial csit a rate splitting approach")
  Member "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "optimized data sharing in multicell mimo with finite backhaul capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference mitigation via rate splitting and common message decoding in cloud radio access networks")
  Member "networked mimo with clustered linear precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing throughput performance in distributed mimo wi fi networks using deep reinforcement learning")

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)