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 "security in cognitive radio networks"):
  Abstract: In this paper, we investigate the information-theoretic security by modeling a cognitive radio wiretap channel under quality-of-service (QoS) constraints and interference power limitations inflicted on primary users (PUs). We initially define four different transmission scenarios regarding channel sensing results and their correctness. We provide effective secure transmission rates at which a secondary eavesdropper is refrained from listening to a secondary transmitter (ST). Then, we construct a channel state transition diagram that characterizes this channel model. We obtain the effective secure capacity which describes the maximum constant buffer arrival rate under given QoS constraints. We find out the optimal transmission power policies that maximize the effective secure capacity, and then, we propose an algorithm that, in general, converges quickly to these optimal policy values. Finally, we show the performance levels and gains obtained under different channel conditions and scenarios. And, we emphasize, in particular, the significant effect of hidden-terminal problem on information-theoretic security in cognitive radios.

Includes members:
  Member "on the relationship between the multi antenna secrecy communications and cognitive radio communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust an aided beamforming and power splitting design for secure miso cognitive radio with swipt")
  Member "effective capacity analysis of cognitive radio channels for quality of service provisioning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the effective capacity of an underwater acoustic channel under impersonation attack")
  Member "secrecy in cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "on the secrecy capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")

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)