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: "robust geometry based user scheduling for large mimo systems under realistic channel conditions"
  Abstract: The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information (CSI) at the base station (BS). The multi-user link correlation in the GSCMs arises from the common clusters in the area. The throughput depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS does not require the channel information of all users, by the proposed geometry-based user scheduling algorithm the sum-rate of the system is only slightly less than the well-known greedy weight clique scheme. Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results.

Connected through hyperedge HE-1 (induced by source paper "max min rate of cell free massive mimo uplink with optimal uniform quantization"):
  with members:
    - "on the uplink throughput of zero forcing in cell free massive mimo with coarse quantization"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on the energy efficiency of limited backhaul cell free massive mimo"):
  with members:
    - "on the uplink throughput of zero forcing in cell free massive mimo with coarse quantization"
    - "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"
    - "cell free massive mimo versus small cells"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"

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)