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: "optimal reference signal design for phase noise compensation in multi carrier massive mimo systems"
  Abstract: Millimeter-wave and Terahertz frequencies, while promising high throughput and abundant spectrum, are highly susceptible to hardware non-idealities like phase-noise, which degrade the system performance and make transceiver implementation difficult. In this paper, a novel reference-signal (RS) aided low-complexity and low-latency technique is proposed to mitigate phase-noise in high-frequency multi-carrier massive multiple-input-multiple-output systems. Unlike in existing methods, the proposed RS is transmitted in each symbol and occupies adjacent sub-carriers separated from the data by null sub-carriers. The receiver uses the received RS to estimate and compensate for the dominant spectral components of the phase-noise at each symbol. While the null sub-carriers reduce the interference between the RS and data, the frequency compactness of the RS decouples phase-noise estimation from channel equalization, reducing error propagation. A detailed theoretical analysis of the technique is presented and correspondingly, throughput-optimal designs for the RS sequence, RS bandwidth, power allocation and the number of nulled sub-carriers and estimated spectral components, are derived. A hitherto unexplored interplay between oscillator phase-locked loop design and the performance of phase-noise compensation is also studied. Simulations, performed under 3GPP compliant settings, suggest that the proposed scheme, while achieving better performance than several existing solutions, also effectively compensates for oscillator frequency offsets.

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)