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: "derivation of the closed form ber expressions for dl noma over nakagami m fading channels"
  Abstract: NOMA is as a strong candidate for the Future Radio Access Network (FRA) due to its potential to support massive connectivity and high spectral efficiency. However, the most important drawback of NOMA is the error during Successive Interference Canceller (SIC) is implemented because of the inter-user interferences. In this paper, we derive closed-form exact Bit-Error Rate expressions for Downlink(DL) NOMA over Nakagami-m fading channels in the presence of SIC errors. The derived expressions are validated by the computer simulations. It is shown that the m parameter still represents the diversity order like as OMA systems. Besides, the BER performances of users for NOMA have substantially depended on the power allocation coefficient.

Connected through hyperedge HE-1 (induced by source paper "performance analysis of ssk noma"):
  with members:
    - "spatial modulation assisted multi antenna non orthogonal multiple access"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "a fair power allocation approach to noma in multiuser siso systems"
    - "resource allocation for downlink noma systems key techniques and open issues"
    - "relay selection for cooperative noma"
    - "power and channel allocation for non orthogonal multiple access in 5g systems tractability and computation"
    - "non orthogonal multiple access in multi cell networks theory performance and practical challenges"
    - "fairness for non orthogonal multiple access in 5g 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)