human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the uplink throughput of zero forcing in cell free massive mimo with coarse quantization"
  Abstract: The recently proposed cell-free massive multiple input multiple output (MIMO) architecture is studied for the uplink. In contrast to most previous works, joint detection is performed using global channel state information (CSI). Therefore, we study strategies for transferring CSI to the central processing unit taking into account the fronthaul capacity which limits CSI quantization. Two strategies for pilot-based CSI acquisition are considered:  estimate-and-quantize  and  quantize-and-estimate . These are analyzed using the Bussgang decomposition. For a given quantization constraint for the data and CSI the achievable rate per user with zero forcing is determined. Numerical results show that quantize-and-estimate (the simpler strategy) is similar to or better than estimate-and-quantize at low resolution, especially for 1-bit.

Connected through hyperedge HE-1 (induced by source paper "max min rate of cell free massive mimo uplink with optimal uniform quantization"):
  with members:
    - "ubiquitous cell free massive mimo communications"
    - "on the energy efficiency of limited backhaul cell free massive mimo"
    - "cell free massive mimo with limited backhaul"
    - "on the performance of backhaul constrained cell free massive mimo with linear receivers"
    - "cooperative access networks optimum fronthaul quantization in distributed massive mimo and cloud ran"
    - "network deployment for maximal energy efficiency in uplink with multislope path loss"
    - "enhanced max min sinr for uplink cell free massive mimo systems"
    - "performance of cell free massive mimo systems with mmse and lsfd receivers"

Connected through hyperedge HE-2 (induced by source paper "on the energy efficiency of limited backhaul cell free massive mimo"):
  with members:
    - "on the performance of backhaul constrained cell free massive mimo with linear receivers"
    - "cooperative access networks optimum fronthaul quantization in distributed massive mimo and cloud ran"
    - "enhanced max min sinr for uplink cell free massive mimo systems"
    - "on the total energy efficiency of cell free massive mimo"
    - "robust geometry based user scheduling for large mimo systems under realistic channel conditions"
    - "cell free massive mimo versus small cells"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"

Connected through hyperedge HE-3 (induced by source paper "few bit csi acquisition for centralized cell free massive mimo with spatial correlation"):
  with members:
    - "channel estimation for one bit massive mimo systems exploiting spatio temporal correlations"
    - "cell free massive mimo with limited backhaul"
    - "enhanced max min sinr for uplink cell free massive mimo systems"
    - "recent advances in cloud radio access networks system architectures key techniques and open issues"
    - "cell free massive mimo versus small cells"

Question: Please tell me which class the center node 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)