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: "performance analysis and design of non orthogonal multiple access for wireless communications"
  Abstract: In this thesis, we study performance analysis and resource allocation designs for non-orthogonal multiple access (NOMA) in wireless communication systems. In contrast to conventional orthogonal multiple access (OMA) schemes, NOMA allows multiple users to share the same degree of freedom via superposition coding and the successive interference cancelation (SIC) decoding. Inspired by the solid foundations from the information theory perspective, NOMA has rekindled the interests of researchers as a benefit of the recent advancement in signal processing and silicon technologies. However, comprehensive performance analysis on NOMA and practical resource allocation designs to exploit potential gains of NOMA in terms of spectral and energy efficiency have not been fully studied and investigated in the literature. This thesis attempts to address these problems by providing a unified performance analysis and a systematic resource allocation design for NOMA in wireless communication systems.

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)