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 "secrecy capacity analysis over kappa mu fading channels theory and applications"):
  Abstract: In this paper, we consider the transmission of confidential information over a $\kappa$-$\mu$ fading channel in the presence of an eavesdropper, who also observes $\kappa$-$\mu$ fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and the lower bound of secure outage probability (SOP$^L$) for channel coefficients that are positive, real, independent and non-identically distributed ($i.n.i.d.$). We also provide a closed-form expression for the probability of SPSC when the $\mu$ parameter is assumed to only take positive integer values. We then apply the derived results to assess the secrecy performance of the system in terms of the average signal-to-noise ratio (SNR) as a function of the $\kappa$ and $\mu$ fading parameters. We observed that for fixed values of the eavesdropper's average SNR, increases in the average SNR of the main channel produce a higher probability of SPSC and a lower secure outage probability (SOP). It was also found that when the main channel experiences a higher average SNR than the eavesdropper's channel, the probability of SPSC improved while the SOP was found to decrease with increasing values of $\kappa$ and $\mu$ for the legitimate channel. The versatility of the $\kappa$-$\mu$ fading model, means that the results presented in this paper can be used to determine the probability of SPSC and SOP$^L$ for a large number of other fading scenarios such as Rayleigh, Rice (Nakagami-$n$), Nakagami-$m$, One-Sided Gaussian and mixtures of these common fading models. Additionally, due to the duality of the analysis of secrecy capacity and co-channel interference, the results presented here will also have immediate applicability in the analysis of outage probability in wireless systems affected by co-channel interference and background noise.

Includes members:
  Member "on the equivalence between interference and eavesdropping in wireless communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the calculation of the incomplete mgf with applications to wireless communications")
  Member "analytic expressions and bounds for special functions and applications in communication theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a semi linear approximation of the first order marcum q function with application to predictor antenna systems")
  Member "secrecy capacity region of fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")

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)