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: "cube split a structured grassmannian constellation for non coherent simo communications"
  Abstract: In this paper, we propose a practical structured constellation for non-coherent communication with single transmit antenna over flat and block fading channel without instantaneous channel state information. The constellation symbols belong to the Grassmannian of lines and are defined up to a complex scaling. The constellation is generated by partitioning the Grassmannian of lines into a collection of bent grids and defining a mapping onto each of these bent grids such that the resulting symbols are approximately uniformly distributed on the Grassmannian. With a reasonable choice of parameters, this so-called cube-split constellation has higher packing efficiency, represented by the minimum distance, than other structured constellations in the literature. Furthermore, exploiting the constellation structure, we design low-complexity greedy symbol decoder and low-complexity log-likelihood ratio computation. Numerical results show that the performance of the cube-split constellation is close to that of a numerically optimized constellation, and better than other structured constellations. It also outperforms a coherent pilot-based scheme in terms of error probability and achievable data rate.

Connected through hyperedge HE-1 (induced by source paper "joint constellation design for the two user non coherent multiple access channel"):
  with members:
    - "the optimal dof region for the two user non coherent simo multiple access channel"
    - "energy based modulation for noncoherent massive simo systems"
    - "manopt a matlab toolbox for optimization on manifolds"

Connected through hyperedge HE-2 (induced by source paper "multi user detection based on expectation propagation for the non coherent simo multiple access channel"):
  with members:
    - "probabilistic mimo symbol detection with expectation consistency approximate inference"
    - "fifty years of mimo detection the road to large scale mimos"
    - "manopt a matlab toolbox for optimization on manifolds"
    - "a new class of upper bounds on the log partition function"
    - "on the capacity of large mimo block fading channels"
    - "mimo detection for high order qam based on a gaussian tree approximation"

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)