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 secrecy performance of generalized user selection for interference limited multiuser wireless networks"):
  Abstract: We investigate the secrecy performance of a multiuser diversity scheme for an interference-limited wireless network with a base station (BS),   $N$   legitimate users, and an eavesdropper in the presence of a single dominant interferer. Assuming interference dominates noise power at the eavesdropper and at each legitimate user's receiver, the BS transmits information to the legitimate user with the   $k$  th best (highest) signal-to-interference ratio. We derive a closed-form expression for the secrecy outage probability for an arbitrary   $N$   and an asymptotic expression for a fixed   $k$   and large   $N$  . Furthermore, we derive a closed form asymptotic expression for the ergodic secrecy capacity of the   $k$  th best user and shows that it scales like   $O\left(\log (N)\right)$   for a fixed   $k$   and large   $N$  .

Includes members:
  Member "on the asymptotic throughput of the k th best secondary user selection in cognitive radio systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotic performance analysis of generalized user selection for interference limited multiuser secondary networks")
  Member "physical layer security in the presence of interference":
    also connected through other hyperedges:
      (none)
  Member "secrecy outage and diversity analysis of cognitive radio systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")

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)