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 "fundamental limits of distributed tracking"):
  Abstract: Consider the following communication scenario. A Gauss-Markov source is observed by K isolated observers via independent AWGN channels, who causally compress their observations to transmit to the decoder via noiseless rate-constrained links. At each time instant, the decoder receives K new codewords from the observers, combines them with the past received codewords, and produces a minimum mean-square error running estimate of the source. This is a causal version of the Gaussian CEO problem. We determine the minimum asymptotically achievable sum rate required to achieve a given mean-square error, which is stated as an optimization problem over K parameters. We give an explicit expression for the symmetrical case, and compute the limit of the sum rate as K→∞, which turns out to be finite and nontrivial. Furthermore, using a suboptimal waterfilling allocation among the K parameters, we explicitly bound the loss due to a lack of cooperation among the observers; that bound is attained with equality in the symmetrical case.

Includes members:
  Member "rate cost tradeoffs in control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "leveraging linear quadratic regulator cost and energy consumption for ultra reliable and low latency iot control systems")
  Member "a characterization of the minimal average data rate that guarantees a given closed loop performance level":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zero delay rate distortion via filtering for vector valued gaussian sources")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a converse bound characterization on zero delay indirect rdf for vector gauss markov sources")
  Member "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized gaussian multiterminal source coding in the high resolution regime")
  Member "rate region of the quadratic gaussian two encoder source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")

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)