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: "a low complexity soft output wmd decoding for uplink mimo systems with one bit adcs"
  Abstract: This paper considers an uplink multiuser multiple-input-multiple-output (MU-MIMO) system with one-bit analog-to-digital converters (ADCs), in which $K$ users with a single transmit antenna communicate with one base station (BS) with $N_{\rm r}$ receive antennas. In this system, a novel MU-MIMO detection method, named weighted minimum distance (wMD) decoding, was recently proposed by introducing an equivalent coding problem. Despite of its attractive performance, the wMD decoding has the two limitations to be used in practice: i) the hard-decision outputs can degrade the performance of a channel code; ii) the computational complexity grows exponentially with the $K$. To address those problems, we first present a soft-output wMD decoding that efficiently computes soft metrics (i.e., log-likelihood ratios) from one-bit quantized observations. We then construct a low-complexity (soft-output) wMD decoding by introducing {\em hierarchical code partitioning}. This method can be regarded as a sphere decoding in Hamming space, in that a search-spare is considerably reduced. Finally, we demonstrate that the proposed method significantly performs the state-of-the-art methods with a comparable complexity.

Connected through hyperedge HE-1 (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"
    - "uplink multiuser massive mimo systems with low resolution adcs a coding theoretic approach"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "study of iterative detection and decoding for large scale mimo systems with 1 bit adcs"):
  with members:
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "massive mimo for next generation wireless systems"
    - "quantized iterative message passing decoders with low error floor for ldpc codes"

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)