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: "a new framework for the performance analysis of wireless communications under hoyt nakagami q fading"
  Abstract: We present a novel relationship between the distribution of circular and non-circular complex Gaussian random variables. Specifically, we show that the distribution of the squared norm of a non-circular complex Gaussian random variable, usually referred to as squared Hoyt distribution, can be constructed from a conditional exponential distribution. From this fundamental connection we introduce a new approach, the Hoyt transform method, that allows to analyze the performance of a wireless link under Hoyt (Nakagami-q) fading in a very simple way. We illustrate that many performance metrics for Hoyt fading can be calculated by leveraging well-known results for Rayleigh fading and only performing a finite-range integral. We use this technique to obtain novel results for some information and communication-theoretic metrics in Hoyt fading channels.

Connected through hyperedge HE-1 (induced by source paper "unveiling the hyper rayleigh regime of the fluctuating two ray fading model"):
  with members:
    - "physical layer security over fluctuating two ray fading channels"
    - "new results on the fluctuating two ray model with arbitrary fading parameters and its applications"
    - "the fluctuating two ray fading model statistical characterization and performance analysis"
    - "mgf approach to the analysis of generalized two ray fading models"

Connected through hyperedge HE-2 (induced by source paper "on the similarity between nakagami m fading distribution and the gaussian ensembles of random matrix theory"):
  with members:
    - "from random matrix theory to coding theory volume of a metric ball in unitary group"

Connected through hyperedge HE-3 (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"
    - "on the equivalence between interference and eavesdropping in wireless communications"
    - "secrecy capacity analysis over kappa mu fading channels theory and applications"
    - "mgf approach to the analysis of generalized two ray fading models"
    - "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-4 (induced by source paper "on the equivalence between interference and eavesdropping in wireless communications"):
  with members:
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"

Connected through hyperedge HE-5 (induced by source paper "the kappa mu shadowed fading model unifying the kappa mu and eta mu distributions"):
  with members:
    - "mgf approach to the analysis of generalized two ray fading models"

Connected through hyperedge HE-6 (induced by source paper "mgf approach to the analysis of generalized two ray fading models"):
  with members:
    - "a unified mgf based capacity analysis of diversity combiners over generalized fading channels"

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)