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 "physical layer security with multiuser scheduling in cognitive radio networks"):
  Abstract: In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.

Includes members:
  Member "intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")
  Member "optimal relay selection for physical layer security in cooperative wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy outage analysis of non orthogonal spectrum sharing for heterogeneous cellular networks")
  Member "robust beamforming for security in mimo wiretap channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal precoder designs for sum utility maximization in swipt enabled multi user mimo cognitive radio networks")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")

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)