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 bivariate nakagami m cumulative distribution function closed form expression and applications"
  Abstract: In this paper, we derive exact closed-form expressions for the bivariate Nakagami-m cumulative distribution function (CDF) with positive integer fading severity index m in terms of a class of hypergeometric functions. Particularly, we show that the bivariate Nakagami-m CDF can be expressed as a finite sum of elementary functions and bivariate confluent hypergeometric Φ3 functions. Direct applications which arise from the proposed closed-form expression are the outage probability (OP) analysis of a dual-branch selection combiner in correlated Nakagami-m fading, or the calculation of the level crossing rate (LCR) and average fade duration (AFD) of a sampled Nakagami-m fading envelope.

Connected through hyperedge HE-1 (induced by source paper "asymptotic outage analysis of harq ir over time correlated nakagami m fading channels"):
  with members:
    - "energy efficient adaptive power allocation for incremental mimo systems"
    - "green communication via power optimized harq protocols"
    - "outage exponent a unified performance metric for parallel fading channels"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-2 (induced by source paper "higher order statistics in switch and stay diversity systems"):
  with members:
    - "cooperative diversity with mobile nodes capacity outage rate and duration"
    - "outage rates and outage durations of opportunistic relaying systems"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-3 (induced by source paper "eigenvalue dynamics of a central wishart matrix with application to mimo systems"):
  with members:
    - "distribution of the largest eigenvalue for real wishart and gaussian random matrices and a simple approximation for the tracy widom distribution"
    - "massive mimo for next generation wireless systems"
    - "on the distribution of mimo mutual information an in depth painleve based characterization"
    - "on the mutual information distribution of ofdm based spatial multiplexing exact variance and outage approximation"
    - "mimo multichannel beamforming ser and outage using new eigenvalue distributions of complex noncentral wishart matrices"

Connected through hyperedge HE-4 (induced by source paper "analytic expressions and bounds for special functions and applications in communication theory"):
  with members:
    - "the area under a receiver operating characteristic curve over enriched multipath fading conditions"
    - "an approximation of the first order marcum q function with application to network connectivity analysis"
    - "on the monotonicity log concavity and tight bounds of the generalized marcum and nuttall q functions"
    - "on the monotonicity of the generalized marcum and nuttall q functions"

Connected through hyperedge HE-5 (induced by source paper "connections between the generalized marcum q function and a class of hypergeometric functions"):
  with members:
    - "on the monotonicity log concavity and tight bounds of the generalized marcum and nuttall q functions"

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)