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 reduced complexity soft output mimo ml detection"
  Abstract: In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO detection is list decoding and lattice decoding. This paper proposes a new class of lattice detectors that combines some of the principles of both list and lattice decoding, thus resulting in an efficient parallelizable implementation and near optimal soft-ouput ML performance. The novel detector is called layered orthogonal lattice detector (LORD), because it adopts a new lattice formulation and relies on a channel orthogonalization process. It should be noted that the algorithm achieves optimal hard-output ML performance in case of two transmit antennas. For two transmit antennas max-log bit soft-output information can be generated and for greater than two antennas approximate max-log detection is achieved. Simulation results show that LORD, in MIMO system employing orthogonal frequency division multiplexing (OFDM) and bit interleaved coded modulation (BICM) is able to achieve very high signal-to-noise ratio (SNR) gains compared to practical soft-output detectors such as minimum-mean square error (MMSE), in either linear or nonlinear iterative scheme. Besides, the performance comparison with hard-output decoded algebraic space time codes shows the fundamental importance of soft-output generation capability for practical wireless applications.

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)