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 "max min rate of cell free massive mimo uplink with optimal uniform quantization"):
  Abstract: Cell-free Massive multiple-input multiple-output (MIMO) is considered, where distributed access points (APs) multiply the received signal by the conjugate of the estimated channel, and send back a quantized version of this weighted signal to a central processing unit (CPU). For the first time, we present a performance comparison between the case of perfect fronthaul links, the case when the quantized version of the estimated channel and the quantized signal are available at the CPU, and the case when only the quantized weighted signal is available at the CPU. The Bussgang decomposition is used to model the effect of quantization. The max-min problem is studied, where the minimum rate is maximized with the power and fronthaul capacity constraints. To deal with the non-convex problem, the original problem is decomposed into two sub-problems (referred to as receiver filter design and power allocation). Geometric programming (GP) is exploited to solve the power allocation problem whereas a generalized eigenvalue problem is solved to design the receiver filter. An iterative scheme is developed and the optimality of the proposed algorithm is proved through uplink-downlink duality. A user assignment algorithm is proposed which significantly improves the performance. Numerical results demonstrate the superiority of the proposed schemes.

Includes members:
  Member "on the uplink throughput of zero forcing in cell free massive mimo with coarse quantization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the energy efficiency of limited backhaul cell free massive mimo")
  Member "ubiquitous cell free massive mimo communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "on the energy efficiency of limited backhaul cell free massive mimo":
    also connected through other hyperedges:
      (none)
  Member "cell free massive mimo with limited backhaul":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "local partial zero forcing precoding for cell free massive mimo")
  Member "on the performance of backhaul constrained cell free massive mimo with linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiple antenna technologies for beyond 5g")
  Member "cooperative access networks optimum fronthaul quantization in distributed massive mimo and cloud ran":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the energy efficiency of limited backhaul cell free massive mimo")
  Member "network deployment for maximal energy efficiency in uplink with multislope path loss":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "enhanced max min sinr for uplink cell free massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spectral efficiency analysis of cell free massive mimo systems with zero forcing detector")

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)