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: "matrix completion based channel estimation for mmwave communication systems with array inherent impairments"
  Abstract: Hybrid massive MIMO structures with reduced hardware complexity and power consumption have been widely studied as a potential candidate for millimeter wave communications. Channel estimators that require knowledge of the array response, such as those using compressive sensing (CS) methods, may suffer from performance degradation when array-inherent impairments bring unknown phase errors and gain errors to the antenna elements. In this paper, we design matrix completion (MC)-based channel estimation schemes which are robust against the array-inherent impairments. We first design an open-loop training scheme that can sample entries from the effective channel matrix randomly and is compatible with the phase shifter-based hybrid system. Leveraging the low-rank property of the effective channel matrix, we then design a channel estimator based on the generalized conditional gradient framework and the alternating minimization approach. The resulting estimator is immune to array-inherent impairments and can be implemented to systems with any array shapes for its independence of the array response. In addition, we extend our design to sample a transformed channel matrix following the concept of inductive matrix completion (IMC), which can be solved efficiently using our proposed channel estimator and can achieve similar performance with a lower requirement of the dynamic range of the transmission power per antenna. Numerical results demonstrate the advantages of our proposed MC-based channel estimator in terms of estimation performance, computational complexity, and robustness against array-inherent impairments over the orthogonal matching pursuit-based CS channel estimator.

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)