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: "outage exponent a unified performance metric for parallel fading channels"
  Abstract: The parallel fading channel, which consists of finite number of subchannels, is very important, because it can be used to formulate many practical communication systems. The outage probability, on the other hand, is widely used to analyze the relationship among the communication efficiency, reliability, signal-to-noise ratio (SNR), and channel fading. To the best of our knowledge, the previous works only studied the asymptotic outage performance of the parallel fading channels which are only valid for a large number of subchannels or high SNRs. In this paper, a unified performance metric, which we shall refer to as the outage exponent, will be proposed. Our approach is mainly based on the large deviations theory and Meijer's G-function. It is shown that the proposed outage exponent is not only an accurate estimation of the outage probability for any number of subchannels, any SNR, and any target transmission rate, but also provides an easy way to compute the outage capacity, finite-SNR diversity-multiplexing tradeoff, and SNR gain. The asymptotic performance metrics, such as the delay-limited capacity, ergodic capacity, and diversity-multiplexing tradeoff can be directly obtained by letting the number of subchannels or SNR tend to infinity. Similar to Gallager's error exponent, a reliable function for parallel fading channels, which illustrates a fundamental relationship between the transmission reliability and efficiency, can also be defined from the outage exponent. Therefore, the proposed outage exponent provides a complete and comprehensive performance measure for parallel fading channels.

Connected through hyperedge HE-1 (induced by source paper "how reliable and capable is multi connectivity"):
  with members:
    - "latency analysis of systems with multiple interfaces for ultra reliable m2m communication"

Connected through hyperedge HE-2 (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"
    - "on the bivariate nakagami m cumulative distribution function closed form expression and applications"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-3 (induced by source paper "an outage exponent region based coded f matching framework for channel allocation in multi carrier multi access channels"):
  with members:
    - "on the existence of universally decodable matrices"
    - "approximately universal codes over slow 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)