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: "mu ufmc system performance analysis and optimal filter length and zero padding length design"
  Abstract: Universal filtered multi-carrier (UFMC) systems offer a flexibility of filtering arbitrary number of subcarriers to suppress out of band (OoB) emission, while keeping the orthogonality between subbands and subcarriers within one subband. However, subband filtering may affect system performance and capacity in a number of ways. In this paper, we first propose the conditions for interference-free one-tap equalization and corresponding signal model in the frequency domain for multi-user (MU) UFMC system. Based on this ideal interference-free case, impact of subband filtering on the system performance is analyzed in terms of average signal-to-noise ratio (SNR) per subband, capacity per subcarrier and bit error rate (BER) and compared with the orthogonal frequency division multiplexing (OFDM) system. This is followed by filter length selection strategies to provide guidelines for system design. Next, by taking carrier frequency offset (CFO), timing offset (TO), insufficient guard interval between symbols and filter tail cutting (TC) into consideration, an analytical system model is established. New channel equalization algorithms are proposed by considering the errors and imperfections based on the derived signal models. In addition, a set of optimization criteria in terms of filter length and guard interval/filter TC length subject to various constraints is formulated to maximize the system capacity. Numerical results show that the analytical and corresponding optimal approaches match the simulation results, and the proposed equalization algorithms can significantly improve the BER performance.

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)