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: "space codes for mimo optical wireless communications error performance criterion and code construction"
  Abstract: In this paper, we consider a multiple-input-multiple-output optical wireless communication (MIMO-OWC) system in the presence of log-normal fading. In this scenario, a general criterion for the design of full-diversity space code (FDSC) with the maximum likelihood (ML) detector is developed. This criterion reveals that in a high signal-to-noise ratio (SNR) regime, MIMO-OWC offers both large-scale diversity gain, governing the exponential decaying of the error curve, and small-scale diversity gain, producing traditional power-law decaying. Particularly for a two by two MIMO-OWC system with unipolar pulse amplitude modulation (PAM), a closed-form solution to the design problem of a linear FDSC optimizing both diversity gains is attained by taking advantage of the available properties on the successive terms of Farey sequences in number theory as well as by developing new properties on the disjoint intervals formed by the Farey sequence terms to attack the continuous and discrete variables mixed max-min design problem. In fact, this specific design not only proves that a repetition code (RC) is the optimal linear FDSC optimizing both the diversity gains, but also uncovers a significant difference between MIMO radio frequency (RF) communications and MIMO-OWC that space dimension alone is sufficient for a full large-scale diversity achievement. Computer simulations demonstrate that FDSC substantially outperforms uncoded spatial multiplexing with the same total optical power and spectral efficiency, and the latter provides only the small-scale diversity gain.

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)