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: "full large scale diversity space codes for mimo optical wireless communications"
  Abstract: In this paper, we consider a multiple-input-multiple-output optical wireless communication (MIMO-OWC) system suffering from log-normal fading. In this scenario, a general criterion for the design of full large-scale diversity space code (FLDSC) with the maximum likelihood (ML) detector is developed. Based on our criterion, FLDSC is attained if and only if all the entries of the space coding matrix are positive. Particularly for $2\times 2$ MIMO-OWC with unipolar pulse amplitude modulation (PAM), a closed-form linear FLDSC satisfying this criterion is attained by smartly taking advantage of some available properties as well as by developing some new interesting properties on Farey sequences in number theory to rigorously attack the continuous and discrete variables mixed max-min problem. In fact, this specific design not only proves that a repetition code (RC) is the best linear FLDSC, but also uncovers a significant difference between MIMO radio frequency (RF) communications and MIMO-OWC that space-only transmission is sufficient for a full diversity achievement. Computer simulations demonstrate that FLDSC substantially outperforms spatial multiplexing with the same total optical power and spectral efficiency and the latter obtains only the small-scale diversity gain.

Connected through hyperedge HE-1 (induced by source paper "reliable mimo optical wireless communications through super rectangular cover"):
  with members:
    - "high snr ber comparison of coherent and differentially coherent modulation schemes in lognormal fading channels"
    - "full diversity codes for miso systems equipped with linear or ml detectors"
    - "quasi orthogonal stbc with minimum decoding complexity"

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)