human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "secrecy analysis of physical layer over kappa mu shadowed fading scenarios"
  Abstract: In this paper, the secrecy analysis of physical layer when both the main and wiretap channels undergo $\kappa-\mu$ shadowed fading channel is investigated. In particular, the average secrecy capacity (ASC), secure outage probability (SOP), the lower bound of SOP (SOP$^L$), and the probability of strictly positive secrecy capacity (SPSC) are derived by using the classic Wyner's wiretap model. Two different scenarios for the fading parameters, i.e., $\mu$ and $m$ which represents the shadowing impact have been studied. These parameters are chosen first as arbitrary numbers, thus the performance metrics are expressed in single infinite series with multivariate Meijer $G$-function. In the second scenario, both the aforementioned fading parameters are assumed to be integer numbers in order to obtain the derived results in simple exact closed-form analytic mathematically tractable expressions. The numerical results of this analysis are verified via Monte Carlo simulations.

Connected through hyperedge HE-1 (induced by source paper "performance analysis of physical layer security over fluctuating beckmann fading channels"):
  with members:
    - "on physical layer security over fox s h function wiretap fading channels"
    - "effective rate analysis over fluctuating beckmann fading channels"
    - "an extension of the kappa mu shadowed fading model statistical characterization and applications"
    - "secrecy outage analysis over correlated composite nakagami m gamma fading channels"
    - "secrecy capacity analysis over kappa mu fading channels theory and applications"

Question: Please tell me which class the center node 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)