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 asymptotic analysis of the high order statistics of the channel capacity over generalized fading channels"
  Abstract: In this article, we provide further asymptotic analysis to the higher-order statistics (HOS) of the channel capacity over generalized fading channels, especially by proposing simple and closed-form expressions each of which can be easily computed as a tight-bound revealing the existence of constant gap between the actual and asymptotic HOS of the channel capacity in the limit of both high- and low-signal to noise ratios (SNRs). As such, we show that these closed-form asymptotic expressions are insightful enough to comprehend the diversity gains. The mathematical formalism we followed in this article is illustrated with some selected numerical examples that validate the correctness of our newly derived asymptotic results.

Connected through hyperedge HE-1 (induced by source paper "on the relationships between average channel capacity average bit error rate outage probability and outage capacity over additive white gaussian noise channels"):
  with members:
    - "asymptotic capacity analysis for adaptive transmission schemes under general fading distributions"
    - "a novel ergodic capacity analysis of diversity combining and multihop transmission systems over generalized composite fading channels"
    - "on the computation of the higher order statistics of the channel capacity over generalized fading channels"
    - "a unified mgf based capacity analysis of diversity combiners over generalized fading channels"
    - "mutual information and minimum mean square error in gaussian 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)