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: "time frequency selective mimo precoding for ofdm with insufficient cp"
  Abstract: A cyclic prefix (CP) for an orthogonal frequency division multiplexing (OFDM) transmission shorter than the maximum delay spread of the channel results into inter-symbol interference (ISI) and inter-carrier interference (ICI). This paper shows that an appropriate frequency-domain multi-antenna (MIMO) precoding for OFDM can asymptotically cancel out ISI/ICI as the number of antennas goes to infinity. The method is based on introducing time-delay selectivity over the channel taps from which a conventional frequency-domain precoding method can be based on. This time-selectivity enables to asymptotically remove undesired delayed signals, while the frequency-selectivity in the precoders is preserved to suit the conventional MIMO-OFDM air interface where precoding is applied on a subcarrier level. Analysis reveals an optimization trade-off in the precoding design between interference removal and multi-path diversity gain. The resulting optimized precoders are shown to provide subsequent gains in asymptotic achievable rate with infinite number of antennas, as well as in symbol-error-rate performance of a moderate finite-antenna system.

Connected through hyperedge HE-1 (induced by source paper "channel shortening by large multiantenna precoding in ofdm"):
  with members:
    - "ofdm without cp in massive mimo"
    - "performance analysis of massive mimo for cell boundary users"
    - "energy and spectral efficiency of very large multiuser mimo systems"

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)