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 analysis of random mimo wireless networks over alpha mu fading channels"):
  Abstract: In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent homogeneous Poisson point processes (HPPPs). Specifically, accounting for the presence of non-colluding eavesdroppers, secrecy performance metrics, including the connection outage probability (COP), the probability of non-zero secrecy capacity (PNZ) and ergodic secrecy capacity, are derived regarding the $k$-th nearest/best user cases. The index for the $k$-th nearest user is extracted from the ordering, in terms of the distances between transmitters and receivers, whereas that for the $k$-th best user is based on the combined effects of path-loss and small-scale fading. In particular, the probability density functions (PDFs) and cumulative distribution functions (CDFs) of the composite channel gain, for the $k$-th nearest and best user, are characterized, respectively. Benefiting from these results, closed-form representations of the COP, PNZ and ergodic secrecy capacity are subsequently obtained. Furthermore, a limit on the maximal number of the best-ordered users is also computed, for a given secrecy outage constraint. Finally, numerical results are provided to verify the correctness of our derivations. Additionally, the effects of fading parameters, path-loss exponent, and density ratios are also analyzed.

Includes members:
  Member "on secrecy performance of antenna selection aided mimo systems against eavesdropping":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "physical layer security in millimeter wave cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy outage analysis of non orthogonal spectrum sharing for heterogeneous cellular networks")
  Member "performance analysis for physical layer security in multi antenna downlink networks with limited csi feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on interference alignment with imperfect csi characterizations of outage probability ergodic rate and ser")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "a geometric interpretation of fading in wireless networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ergodic spectral efficiency in mimo cellular networks")

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)