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: "nonregenerative mimo relaying with optimal transmit antenna selection"
  Abstract: We derive optimal SNR-based transmit antenna selection rules at the source and relay for the nonregenerative half-duplex MIMO relay channel. While antenna selection is a suboptimal form of beamforming, it has the advantage that the optimization is tractable and can be implemented with only a few bits of feedback from the destination to the source and relay. We compare the bit error rate of optimal antenna selection at both the source and relay to other proposed beamforming techniques and propose methods for performing the necessary limited feedback.

Connected through hyperedge HE-1 (induced by source paper "sub modularity and antenna selection in mimo systems"):
  with members:
    - "massive mimo how many antennas do we need"
    - "relay subset selection in wireless networks using partial decode and forward transmission"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "end to end joint antenna selection strategy and distributed compress and forward strategy for relay channels"):
  with members:
    - "to code or not to code in multi hop relay channels"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "relay subset selection in wireless networks using partial decode and forward transmission"
    - "diversity of mimo multihop relay channels"
    - "a simple cooperative diversity method based on network path selection"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

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)