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: "hybrid channel pre inversion and interference alignment strategies"
  Abstract: In this paper we consider strategies for MIMO interference channels which combine the notions of interference alignment and channel pre-inversion. Users collaborate to form data-sharing groups, enabling them to clear interference within a group, while interference alignment is employed to clear interference between groups. To improve the capacity of our schemes at finite SNR, we propose that the groups of users invert their subchannel using a regularized Tikhonov inverse. We provide a new sleeker derivation of the optimal Tikhonov parameter, and use random matrix theory to provide an explicit formula for the SINR as the size of the system increases, which we believe is a new result. For every possible grouping of K = 4 users each with N = 5 antennas, we completely classify the degrees of freedom available to each user when using such hybrid schemes, and construct explicit interference alignment strategies which maximize the sum DoF. Lastly, we provide simulation results which compute the ergodic capacity of such schemes.

Connected through hyperedge HE-1 (induced by source paper "channel pre inversion and max sinr vector perturbation for large scale broadcast channels"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "fixed complexity vector perturbation with block diagonalization for mu mimo systems"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "on fast decodable space time block codes"

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)