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: "a unified framework for non orthogonal multiple access"
  Abstract: This paper proposes a unified framework of non-orthogonal multiple access (NOMA) networks. Stochastic geometry is employed to model the locations of spatially NOMA users. The proposed unified NOMA framework is capable of being applied to both code-domain NOMA (CD-NOMA) and power-domain NOMA (PD-NOMA). Since the detection of NOMA users mainly depend on efficient successive interference cancelation (SIC) schemes, both imperfect SIC (ipSIC) and perfect SIC (pSIC) are taken into account. To characterize the performance of the proposed unified NOMA framework, the exact and asymptotic expressions of outage probabilities as well as delay-limited throughput for CD/PD-NOMA with ipSIC/pSIC are derived. In order to obtain more insights, the diversity analysis of a pair of NOMA users (i.e., the  n th user and  m th user) is provided. Our analytical results reveal that: 1) the diversity orders of  m th and  n th user with pSIC for CD-NOMA are  mK  and  nK , respectively; 2) due to the influence of residual interference, the  n th user with ipSIC obtains a zero diversity order; and 3) the diversity order is determined by the user who has the poorer channel conditions out of the pair. Finally, Monte Carlo simulations are presented to verify the analytical results: 1) when the number of subcarriers becomes lager, the NOMA users are capable of achieving more steep slope in terms of outage probability and 2) the outage behavior of CD-NOMA is superior to that of PD-NOMA.

Connected through hyperedge HE-1 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks"):
  with members:
    - "intelligent reflecting surface assisted multiple access with user pairing noma or oma"
    - "on the impact of phase shifting designs on irs noma"
    - "intelligent reflecting surface versus decode and forward how large surfaces are needed to beat relaying"
    - "secure wireless communication via intelligent reflecting surface"
    - "intelligent reflecting surface assisted non orthogonal multiple access"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "a simple design of irs noma transmission"
    - "secure communications in a unified non orthogonal multiple access framework"

Connected through hyperedge HE-2 (induced by source paper "outage behaviors of noma based satellite network over shadowed rician fading channels"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "noma assisted wireless caching strategies and performance analysis"
    - "enhancing the physical layer security of non orthogonal multiple access in large scale networks"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"
    - "generic optimization of linear precoding in multibeam satellite systems"

Connected through hyperedge HE-3 (induced by source paper "secure communications in a unified non orthogonal multiple access framework"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "user association and resource allocation in unified noma enabled heterogeneous ultra dense networks"
    - "securing downlink non orthogonal multiple access systems by trusted relays"
    - "edge computing aware noma for 5g networks"
    - "impact of non orthogonal multiple access on the offloading of mobile edge computing"
    - "secure communications in noma system subcarrier assignment and power allocation"
    - "performance analysis of noma with fixed gain relaying over nakagami m fading channels"
    - "non orthogonal multiple access in large scale heterogeneous networks"

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)