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: "multiple beamforming with perfect coding"
  Abstract: Perfect Space-Time Block Codes (PSTBCs) achieve full diversity, full rate, nonvanishing constant minimum determinant, uniform average transmitted energy per antenna, and good shaping. However, the high decoding complexity is a critical issue for practice. When the Channel State Information (CSI) is available at both the transmitter and the receiver, Singular Value Decomposition (SVD) is commonly applied for a Multiple-Input Multiple-Output (MIMO) system to enhance the throughput or the performance. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing both PSTBCs and SVD with and without channel coding, respectively. With CSI at the transmitter (CSIT), the decoding complexity of PCMB is substantially reduced compared to a MIMO system employing PSTBC, providing a new prospect of CSIT. Especially, because of the special property of the generation matrices, PCMB provides much lower decoding complexity than the state-of-the-art SVD-based uncoded technique in dimensions 2 and 4. Similarly, the decoding complexity of BICMB-PC is much lower than the state-of-the-art SVD-based coded technique in these two dimensions, and the complexity gain is greater than the uncoded case. Moreover, these aforementioned complexity reductions are achieved with only negligible or modest loss in performance.

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"
    - "bit interleaved coded multiple beamforming with perfect coding"
    - "constellation precoded beamforming"
    - "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"
    - "bit interleaved coded multiple beamforming with perfect coding"
    - "mimo networks the effects of interference"
    - "constellation precoded beamforming"
    - "constellation precoded multiple beamforming"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "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)