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: "on the equivalence between interference and eavesdropping in wireless communications"
  Abstract: We show that the problem of analyzing the outage probability (OP) in cellular systems affected by cochannel interference (CCI) and background noise (BN) is mathematically equivalent to the problem of analyzing the wireless information-theoretic security in terms of the secrecy OP in fading channels. Hence, these both apparently unrelated problems can be addressed by using a common approach. We illustrate the applicability of the connection unveiled herein to provide new results for the secrecy OP in different scenarios.

Connected through hyperedge HE-1 (induced by source paper "on the calculation of the incomplete mgf with applications to wireless communications"):
  with members:
    - "the kappa mu shadowed fading model with integer fading parameters"
    - "secrecy capacity analysis over kappa mu fading channels theory and applications"
    - "mgf approach to the analysis of generalized two ray fading models"
    - "a new framework for the performance analysis of wireless communications under hoyt nakagami q fading"
    - "a unified mgf based capacity analysis of diversity combiners over generalized fading channels"
    - "an mgf based unified framework to determine the joint statistics of partial sums of ordered random variables"

Connected through hyperedge HE-2 (induced by source paper "secrecy capacity analysis over kappa mu fading channels theory and applications"):
  with members:
    - "analytic expressions and bounds for special functions and applications in communication theory"
    - "secrecy capacity region of fading broadcast channels"
    - "the gaussian multiple access wire tap channel"

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)