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: "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding"
  Abstract: Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as long as the code rate R c  and the number of employed subchannels S satisfy the condition R c S ≤ 1. Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding (BICMB-CP), on the other hand, can achieve full diversity without the condition R c S ≤ 1. However, the decoding complexity of BICMB-CP is much higher than BICMB. In this paper, a reduced complexity decoding technique, which is based on Sphere Decoding (SD), is proposed to reduce the complexity of Maximum Likelihood (ML) decoding for BICMB-CP. The decreased complexity decoding achieves several orders of magnitude reduction, in terms of the average number of real multiplications needed to acquire one precoded bit metric, not only with respect to conventional ML decoding, but also, with respect to conventional SD.

Connected through hyperedge HE-1 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding"):
  with members:
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "golden coded multiple beamforming"
    - "constellation precoded beamforming"
    - "constellation precoded multiple beamforming"
    - "mimo precoding with x and y codes"
    - "reduced complexity sphere decoding"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"

Connected through hyperedge HE-2 (induced by source paper "multiple beamforming with perfect coding"):
  with members:
    - "constellation precoded beamforming"
    - "constellation precoded multiple beamforming"
    - "reduced complexity sphere decoding"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"
    - "fast maximum likelihood decoding of the golden code"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"
    - "perfect space time codes with minimum and non minimum delay for any number of antennas"

Connected through hyperedge HE-3 (induced by source paper "reduced complexity sphere decoding"):
  with members:
    - "constellation precoded multiple beamforming"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"

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)