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: "analysis and design specifications for full duplex radio transceivers under rf oscillator phase noise with arbitrary spectral shape"
  Abstract: In this paper, the effects of oscillator phase-noise with arbitrary spectral characteristics on self-interference cancellation capability of a full-duplex radio transceiver are addressed, and design considerations are given for oscillator designers for optimized PLL design for full-duplex radio application. The paper first gives a full-duplex transceiver model that inherently mitigates most of the phase-noise effect from the self-interference signal. The remaining effect of the phase noise is then analysed. Closed-form solutions for the self-interference power are then derived. In the simulations part, a practical phase-locked loop type oscillator is used, which is based on the arbitrary mask phase-noise model. Analytical derivations are verified with the simulations, and the self-interference cancellation performance is thoroughly studied with various parameters. Design considerations are finally given for oscillator design for full-duplex radio transceivers, with the help of tangible parameters of the phase-locked loop type oscillators.

Connected through hyperedge HE-1 (induced by source paper "an inter user interference suppression method in full duplex networks"):
  with members:
    - "inter user interference coordination in full duplex systems based on geographical context information"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"
    - "pushing the limits of full duplex design and real time implementation"

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)