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: "uplink multiuser massive mimo systems with low resolution adcs a coding theoretic approach"
  Abstract: This paper considers an uplink multiuser massive multiple-input-multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs), in which K users with a single-antenna communicate with one base station (BS) with Nr antennas. In this system, we present a novel multiuser MIMO detection framework that is inspired by coding theory. The key idea of the proposed framework is to create a code C of length 2Nr over a spatial domain. This code is constructed by a so-called auto-encoding function that is not designable but is completely described by a channel transformation followed by a quantization function of the ADCs. From this point of view, we convert a multiuser MIMO detection problem into an equivalent channel coding problem, in which a codeword of C corresponding to users' messages is sent over 2Nr parallel channels, each with different channel reliability. To the resulting problem, we propose a novel weighted minimum distance decoding (wMDD) that appropriately exploits the unequal channel reliabilities. It is shown that the proposed wMDD yields a non-trivial gain over the conventional minimum distance decoding (MDD). From coding-theoretic viewpoint, we identify that bit-error-rate (BER) exponentially decreases with the minimum distance of the code C, which plays a similar role with a condition number in conventional MIMO systems. Furthermore, we develop the communication method that uses the wMDD for practical scenarios where the BS has no knowledge of channel state information. Finally, numerical results are provided to verify the superiority of the proposed method.

Connected through hyperedge HE-1 (induced by source paper "reliable ofdm transmission with ultra low resolution adc"):
  with members:
    - "joint channel estimation decoding with frequency selective channels and few bit adcs"
    - "low complexity multiuser qam detection for uplink 1 bit massive mimo"
    - "a general framework for low resolution receivers for mimo channels"
    - "bayesian optimal data detector for mmwave ofdm system with low resolution adc"
    - "generalized expectation consistent signal recovery for nonlinear measurements"
    - "denoising based turbo compressed sensing"
    - "channel estimation and data equalization in frequency selective mimo systems with one bit quantization"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"

Connected through hyperedge HE-2 (induced by source paper "one bit sphere decoding for uplink massive mimo systems with one bit adcs"):
  with members:
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "a low complexity soft output wmd decoding for uplink mimo systems with one bit adcs"
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "mixed adc massive mimo"
    - "supervised learning aided communication framework for massive mimo systems with low resolution adcs"
    - "capacity analysis of one bit quantized mimo systems with transmitter channel state information"

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)