human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on estimation error outage for scalar gauss markov signals sent over fading channels"):
  Abstract: Measurements of a scalar linear Gauss-Markov process are sent over a fading channel. The fading channel is modeled as independent and identically distributed random variables with known realization at the receiver. The optimal estimator at the receiver is the Kalman filter. In contrast to the classical Kalman filter theory, given a random channel, the Kalman gain and the error covariance become random. Then the probability distribution function of expected estimation error and its outage probability can be chosen for estimation quality assessment. In this paper and in order to get the estimation error outage, we provide means to characterize the stationary probability density function of the random expected estimation error. Furthermore and for the particular case of the i.i.d. Rayleigh fading channels, upper and lower bounds for the outage probability are derived which provide insight and simpler means for design purposes. We also show that the bounds are tight for the high SNR regime, and that the outage probability decreases linearly with the inverse of the average channel SNR.

Includes members:
  Member "distortion outage probability in mimo block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distortion exponent in mimo fading channels with time varying source side information")
  Member "kalman filtering with intermittent observations weak convergence to a stationary distribution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stability analysis and design of a network of event based systems")

Question: Please tell me which class the source paper 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)