human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "secure communications in a unified non orthogonal multiple access framework"):
  Abstract: This paper investigates the impact of physical layer secrecy on the performance of a unified non-orthogonal multiple access (NOMA) framework, where both external and internal eavesdropping scenarios are examined. The spatial locations of legitimate users (LUs) and eavesdroppers are modeled by invoking stochastic geometry. To characterize the security performance, new exact and asymptotic expressions of secrecy outage probability (SOP) are derived for both code-domain NOMA (CD-NOMA) and power-domain NOMA (PD-NOMA), in which imperfect successive interference cancellation (ipSIC) and perfect SIC (pSIC) are taken into account. For the external eavesdropping scenario, the secrecy diversity orders by a pair of LUs (the n-th user and m-th user) for CD/PD-NOMA are obtained. Analytical results make known that the diversity orders of the $n$-th user with ipSIC/pSIC for CD-NOMA and PD-NOMA are equal to zero/K and zero/one, respectively. The diversity orders of the m-th user are equal to K/one for CD/PD-NOMA. For the internal eavesdropping scenario, we examine the analysis of secrecy diversity order and observe that the m-th user to wiretap the n-th user with ipSIC/pSIC for CD-NOMA and PD-NOMA provide the diversity orders of zero/K and zero/one, respectively, which is consistent with external eavesdropping scenario. Numerical results are present to confirm the accuracy of the analytical results developed and show that: i) The secrecy outage behavior of the $n$-th user is superior to that of the m-th user; ii) By increasing the number of subcarriers, CD-NOMA is capable of achieving a larger secrecy diversity gain compared to PD-NOMA.

Includes members:
  Member "exploiting full half duplex user relaying in noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "user association and resource allocation in unified noma enabled heterogeneous ultra dense networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation in intelligent reflecting surface assisted noma systems")
  Member "securing downlink non orthogonal multiple access systems by trusted relays":
    also connected through other hyperedges:
      (none)
  Member "a unified framework for non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "edge computing aware noma for 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "impact of non orthogonal multiple access on the offloading of mobile edge computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "secure communications in noma system subcarrier assignment and power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on the security and the evolution of osmotic and catalytic computing for 5g networks")
  Member "performance analysis of noma with fixed gain relaying over nakagami m fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")

Question: Please tell me which class the source paper 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)