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: "glrt optimal noncoherent lattice decoding"
  Abstract: This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulation (PAM) signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test (GLRT). The computational complexity is polynomial in the block length; making GLRT-optimal noncoherent detection feasible for implementation. We also provide even lower complexity suboptimal algorithms. Simulations show that the suboptimal algorithms have performance indistinguishable from the optimal algorithms. Finally, we consider block-based transmission, and propose to use noncoherent detection as an alternative to pilot-assisted transmission (PAT). The new technique is shown to outperform PAT.

Connected through hyperedge HE-1 (induced by source paper "efficient optimal joint channel estimation and data detection for massive mimo systems"):
  with members:
    - "optimality of large mimo detection via approximate message passing"
    - "joint channel and data estimation for large mimo systems with low precision adcs"
    - "massive mimo for next generation wireless systems"
    - "optimal non coherent data detection for massive simo wireless systems a polynomial complexity solution"
    - "blind pilot decontamination"
    - "massive mimo and small cells improving energy efficiency by optimal soft cell coordination"
    - "massive mu mimo downlink tdd systems with linear precoding and downlink pilots"
    - "massive mimo how many antennas do we need"

Connected through hyperedge HE-2 (induced by source paper "noncoherent trellis coded quantization a practical limited feedback technique for massive mimo systems"):
  with members:
    - "downlink training techniques for fdd massive mimo systems open loop and closed loop training with memory"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "massive mimo how many antennas do we need"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "capacity of a multiple antenna fading channel with a quantized precoding matrix"
    - "mimo broadcast channels with finite rate feedback"
    - "limited feedback beamforming over temporally correlated channels"

Connected through hyperedge HE-3 (induced by source paper "tree structured random vector quantization for limited feedback wireless channels"):
  with members:
    - "signature quantization in fading cdma with limited feedback"
    - "capacity of a multiple antenna fading channel with a quantized precoding matrix"
    - "performance analysis of cdma signature optimization with finite rate feedback"

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)