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: "non orthogonal random access nora for 5g networks"
  Abstract: The massive amounts of machine-type user equipments (UEs) will be supported in the future fifth generation (5G) networks. However, the potential large random access (RA) delay calls for a new RA scheme and for a detailed assessment of its performance. Motivated by the key idea of non-orthogonal multiple access, the non-orthogonal random access (NORA) scheme based on successive interference cancellation (SIC) is proposed in this paper to alleviate the access congestion problem. Specifically, NORA utilizes the difference of time of arrival to identify multiple UEs with the identical preamble, and enables power domain multiplexing of collided UEs in the following access process, while the base station performs SIC based on the channel conditions obtained through preamble detection. Our analysis show that the performance of NORA is superior to the conventional orthogonal random access (ORA) scheme in terms of the preamble collision probability, access success probability and throughput of random access. Simulation results verify our analysis and further show that our NORA scheme can improve the number of the supported UEs by more than 30%. Moreover, the number of preamble transmissions and the access delay for successfully accessed UEs are also reduced significantly by using the proposed random access scheme.

Connected through hyperedge HE-1 (induced by source paper "edge computing aware noma for 5g networks"):
  with members:
    - "toward hierarchical mobile edge computing an auction based profit maximization approach"
    - "joint subcarrier and cpu time allocation for mobile edge computing"
    - "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems"
    - "uplink non orthogonal multiple access for 5g wireless networks"
    - "joint optimization of radio resources and code partitioning in mobile cloud computing"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-2 (induced by source paper "signature based non orthogonal multiple access s noma for massive machine type communications in 5g"):
  with members:
    - "low complexity receiver for uplink scma system via expectation propagation"
    - "massive non orthogonal multiple access for cellular iot potentials and limitations"

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)