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: "constellation precoded beamforming"
  Abstract: We present and analyze the performance of constellation precoded beamforming. This multi-input multi-output transmission technique is based on the singular value decomposition of a channel matrix. In this work, the beamformer is precoded to improve its diversity performance. It was shown previously that while single beamforming achieves full diversity without channel coding, multiple beamforming results in diversity loss. In this paper, we show that a properly designed constellation precoder makes uncoded multiple beamforming achieve full diversity order. We also show that partially precoded multiple beamforming gets better diversity order than multiple beamforming without constellation precoder if the subchannels to be precoded are properly chosen. We propose several criteria to design the constellation precoder. Simulation results match the analysis, and show that precoded multiple beamforming actually outperforms single beamforming without precoding at the same system data rate while achieving full diversity order.

Connected through hyperedge HE-1 (induced by source paper "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing"):
  with members:
    - "diversity analysis of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing"
    - "multiple beamforming with perfect coding"
    - "bit interleaved coded multiple beamforming with perfect coding"
    - "constellation precoded multiple beamforming"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"

Connected through hyperedge HE-2 (induced by source paper "diversity analysis of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing"):
  with members:
    - "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing"
    - "multiple beamforming with perfect coding"
    - "bit interleaved coded multiple beamforming with perfect coding"
    - "mimo networks the effects of interference"
    - "constellation precoded multiple beamforming"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"

Connected through hyperedge HE-3 (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"
    - "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding"
    - "golden coded multiple 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-4 (induced by source paper "multiple beamforming with perfect coding"):
  with members:
    - "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding"
    - "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-5 (induced by source paper "an upper bound to the marginal pdf of the ordered eigenvalues of wishart matrices"):
  with members:
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"

Connected through hyperedge HE-6 (induced by source paper "golden coded multiple beamforming"):
  with members:
    - "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-7 (induced by source paper "constellation precoded multiple beamforming"):
  with members:
    - "augmented lattice reduction for mimo decoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"
    - "a near maximum likelihood decoding algorithm for mimo systems based on semi definite programming"

Connected through hyperedge HE-8 (induced by source paper "bit interleaved coded multiple beamforming with constellation precoding"):
  with members:
    - "diversity analysis of bit interleaved coded multiple beamforming"

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)