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 "on the design of secure non orthogonal multiple access systems"):
  Abstract: This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit power subject to the secrecy outage and quality of service constraints, and derive the closed-form solution to this problem. We then explore the problem of maximizing the minimum confidential information rate among users subject to the secrecy outage and transmit power constraints, and provide an iterative algorithm to solve this problem. We find that the secrecy outage constraint in the studied problems does not change the optimal decoding order for NOMA, and one should increase the power allocated to the user whose channel is relatively bad when the secrecy constraint becomes more stringent. Finally, we show the advantage of NOMA over orthogonal multiple access in the studied problems both analytically and numerically.

Includes members:
  Member "on secrecy metrics for physical layer security over quasi static fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on secure transmission design an information leakage perspective")
  Member "secrecy sum rate maximization in non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security for noma transmission in mmwave drone networks")
  Member "a survey of downlink non orthogonal multiple access for 5g wireless communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "achieving secrecy without knowing the number of eavesdropper antennas":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "artificial noise injection for securing single antenna systems")
  Member "fairness for non orthogonal multiple access in 5g systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation technique for hybrid tdma noma system with opportunistic time assignment")
  Member "a general mimo framework for noma downlink and uplink transmission based on signal alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "secure on off transmission design with channel estimation errors":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on secure transmission design an information leakage perspective")

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)