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: "channel shortening by large multiantenna precoding in ofdm"
  Abstract: A channel delay spread larger than the cyclic prefix (CP) creates self-interference (ISI/ICI) in orthogonal frequency-division multiplexing (OFDM). Recent interests in low-latency application has motivated usage of shorter OFDM symbols. In turn, one can either downscale the CP at the cost of interference, or maintain the CP but with increased overhead. To simultaneously maintain low overhead and interference, this paper studies channel shortening methods exploiting the properties of large multi-antenna precoding in OFDM. It is shown that ISI/ICI can be asymptotically canceled out by subcarrier-level precoding with infinite number of antennas. The method, coined time-frequency (TF) precoding, is based on introducing time-delay selectivity inside conventional frequency-selective precoders in order to remove undesired delayed signals. This leads to an optimization trade-off in the precoder between interference mitigation and multi-path combining gain. Time-reversal (TR) filtering, where an OFDM signal without CP is filtered according to the multi-antenna channels, is considered as a benchmark since it provides asymptotically the optimal rate, having no CP overhead, and both full interference-cancellation and maximum muli-path combining gain. Meanwhile, finite-size analysis shows that TF-precoding converges faster to its asymptotic rate than TR-filtering, so that TF-precoding can outperform TR-filtering in the high-SNR regime with not-so-large number of antennas.

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)