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 spectral efficiency of noncooperative uplink massive mimo systems"
  Abstract: Massive multiple-input multiple-output (MIMO) systems have been drawing considerable interest due to the growing throughput demands on wireless networks. In the uplink, massive MIMO systems are commonly studied assuming that each base station (BS) decodes the signals of its user terminals separately and linearly while treating all interference as noise. Although this approach provides improved spectral efficiency which scales with the number of BS antennas in favorable channel conditions, it is generally sub-optimal from an information-theoretic perspective. In this work we characterize the spectral efficiency of massive MIMO when the BSs are allowed to jointly decode the received signals. In particular, we consider four schemes for treating the interference, and derive the achievable average ergodic rates for both finite and asymptotic number of antennas for each scheme. Simulation tests of the proposed methods illustrate their gains in spectral efficiency compared to the standard approach of separate linear decoding, and show that the standard approach fails to capture the actual achievable rates of massive MIMO systems, particularly when the interference is dominant.

Connected through hyperedge HE-1 (induced by source paper "task based quantization with application to mimo receivers"):
  with members:
    - "dynamic metasurface antennas for mimo ofdm receivers with bit limited adcs"
    - "dynamic metasurface antennas for uplink massive mimo systems"
    - "hardware limited task based quantization"
    - "spectral efficiency of mixed adc massive mimo"
    - "soft to hard vector quantization for end to end learning compressible representations"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "principal inertia components and applications"

Connected through hyperedge HE-2 (induced by source paper "dynamic metasurface antennas for uplink massive mimo systems"):
  with members:
    - "hardware limited task based quantization"
    - "measurement matrix design for phase retrieval based on mutual information"
    - "reconfigurable intelligent surfaces for energy efficiency in wireless communication"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "resolution adaptive hybrid mimo architectures for millimeter wave communications"
    - "hybrid analog digital beamforming for massive mimo systems"
    - "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs"
    - "mixed adc massive mimo detectors performance analysis and design optimization"

Connected through hyperedge HE-3 (induced by source paper "dynamic metasurface antennas for mimo ofdm receivers with bit limited adcs"):
  with members:
    - "reliable ofdm receiver with ultra low resolution adc"
    - "dynamic metasurface antennas for uplink massive mimo systems"
    - "hardware limited task based quantization"
    - "reconfigurable intelligent surfaces for energy efficiency in wireless communication"
    - "a comparison of hybrid beamforming and digital beamforming with low resolution adcs for multiple users and imperfect csi"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "hybrid analog and digital beamforming for mmwave ofdm large scale antenna arrays"
    - "channel estimation in broadband millimeter wave mimo systems with few bit adcs"

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)