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: "spatial coded modulation"
  Abstract: In this paper, we propose a spatial coded modulation (SCM) scheme, which improves the accuracy of the active antenna detection by coding over the transmit antennas. Specifically, the antenna activation pattern in the SCM corresponds to a codeword in a properly designed codebook with a larger minimum Hamming distance than its counterpart conventional spatial modulation. As the minimum Hamming distance increases, the reliability of the active antenna detection is directly enhanced, which in turn improves the demodulation of the modulated symbols and yields a better system reliability. In addition to the reliability, the proposed SCM scheme also achieves a higher capacity with the identical antenna configuration compared to the conventional spatial modulation technique. Moreover, the proposed SCM scheme strikes a balance between spectral efficiency and reliability by trading off the minimum Hamming distance with the number of available codewords. The optimal maximum likelihood detector is first formulated. Then, a low-complexity suboptimal detector is proposed to reduce the computational complexity, which has a two-step detection. Theoretical derivations of the channel capacity and the bit error rate are presented in various channel scenarios, i.e., Rayleigh, Rician, Nakagami-m, imperfect channel state information, and spatial correlation. Further derivation on performance bounding is also provided to reveal the insight of the benefit of increasing the minimum Hamming distance. Numerical results validate the analysis and demonstrate that the proposed SCM outperforms the conventional spatial modulation techniques in both channel capacity and system reliability.

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)