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 "optimal nonanticipative estimation schemes for time varying gauss markov processes"):
  Abstract: In this paper, we derive recursive filters for time-varying multidimensional Gauss-Markov processes, which satisfy a mean square error fidelity, using the concept of Finite Time Horizon (FTH) Nonanticipative Rate Distortion Function (NRDF) and its connection to real-time realizable filtering theory. Moreover, we derive a universal lower bound on the mean square error of any estimator of time-varying multidimensional Gauss-Markov processes in terms of conditional mutual information. Unlike classical Kalman filters, the proposed filter is constructed from the solution of a reverse-waterfilling problem, which ensures that the mean square error fidelity is met. Our theoretical results are demonstrated via illustrative examples.

Includes members:
  Member "directed information on abstract spaces properties and variational equalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a converse bound characterization on zero delay indirect rdf for vector gauss markov sources")
  Member "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a converse bound characterization on zero delay indirect rdf for vector gauss markov sources")

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)