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: "sphere decoding for spatial modulation systems with arbitrary nt"
  Abstract: Recently, three Sphere Decoding (SD) algorithms were proposed for Spatial Modulation (SM) scheme which focus on reducing the transmit-, receive-, and both transmit and receive-search spaces at the receiver and were termed as Receiver-centric SD (Rx-SD), Transmitter-centric SD (Tx-SD), and Combined SD (C-SD) detectors, respectively. The Tx-SD detector was proposed for systems with Nt \leq Nr, where Nt and Nr are the number of transmit and receive antennas of the system. In this paper, we show that the existing Tx-SD detector is not limited to systems with Nt \leq Nr but can be used with systems Nr < Nt \leq 2Nr - 1 as well. We refer to this detector as the Extended Tx-SD (E-Tx-SD) detector. Further, we propose an E- Tx-SD based detection scheme for SM systems with arbitrary Nt by exploiting the Inter-Channel Interference (ICI) free property of the SM systems. We show with our simulation results that the proposed detectors are ML-optimal and offer significantly reduced complexity.

Connected through hyperedge HE-1 (induced by source paper "generalised sphere decoding for spatial modulation"):
  with members:
    - "performance of spatial modulation using measured real world channels"
    - "practical implementation of spatial modulation"
    - "space shift keying ssk mimo with practical channel estimates"
    - "low complexity maximum likelihood detection in spatial modulation systems"
    - "massive mimo how many antennas do we need"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"

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)