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: "unified analysis of the average gaussian error probability for a class of fading channels"
  Abstract: This paper focuses on the analysis of average Gaussian error probabilities in certain fading channels, i.e. we are interested in E[Q((p {\gamma})^(1/2))] where Q(.) is the Gaussian Q-function, p is a positive real number and {\gamma} is a nonnegative random variable. We present a unified analysis of the average Gaussian error probability, derive a compact expression in terms of the Lauricella FD^(n) function that is applicable to a broad class of fading channels, and discuss the relation of this expression and expressions of this type recently appeared in literature. As an intermediate step in our derivations, we also obtain a compact expression for the outage probability of the same class of fading channels. Finally, we show how this unified analysis allows us to obtain novel performance analytical results.

Connected through hyperedge HE-1 (induced by source paper "new results on the sum of gamma random variates with application to the performance of wireless communication systems over nakagami m fading channels"):
  with members:
    - "a note on the sum of correlated gamma random variables"
    - "a new formula for the ber of binary modulations with dual branch selection over generalized k"
    - "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)