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: "a characterization of the minimal average data rate that guarantees a given closed loop performance level"
  Abstract: This paper studies networked control systems closed over noiseless digital channels. We focus on noisy linear time-invariant (LTI) plants with stationary Gaussian disturbances, Gaussian initial state, scalar-valued control inputs and sensor outputs. For this set-up, we show that the absolute minimal directed information rate that allows one to achieve a prescribed level of performance (not necessarily stationary), over all combinations of encoder-controller-decoder, is achieved when the decoder output is jointly Gaussian with the other signals in the system. This directed information rate lower bounds the achievable operational data rates. When restricting our attention to encoder-controller-decoders which make the random processes in the loop (strongly) asymptotically wide-sense stationary, this bound can be expressed in terms of their asymptotic power spectral densities. Then we show that the directed information rate and stationary performance of any such scheme can be achieved when the concatenated encoder, channel, controller and decoder behave as an AWGN channel with LTI filters. We also present a simple coding scheme that allows one to achieve (operational) average data rates that are at most (approximately) 1.254 bits away from the derived lower bound, while satisfying the performance constraint. A numerical example is presented to illustrate our findings.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of distributed tracking"):
  with members:
    - "rate cost tradeoffs in control"
    - "multiterminal source coding under logarithmic loss"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-2 (induced by source paper "zero delay rate distortion via filtering for vector valued gaussian sources"):
  with members:
    - "an upper bound to zero delay rate distortion via kalman filtering for vector gaussian sources"
    - "filtering with fidelity for time varying gauss markov processes"
    - "nonanticipative rate distortion function and relations to filtering theory"
    - "directed information on abstract spaces properties and variational equalities"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "achieving the gaussian rate distortion function by prediction"

Connected through hyperedge HE-3 (induced by source paper "the effect of time delay on the average data rate and performance in networked control systems"):
  with members:
    - "zero delay rate distortion via filtering for vector valued gaussian sources"
    - "interplay between transmission delay average data rate and performance in output feedback control over digital communication channels"
    - "rate cost tradeoffs in control"
    - "stability analysis of continuous time switched systems with a random switching signal"

Connected through hyperedge HE-4 (induced by source paper "stationarity in the realizations of the causal rate distortion function for one sided stationary sources"):
  with members:
    - "an upper bound to zero delay rate distortion via kalman filtering for vector gaussian sources"
    - "information nonanticipative rate distortion function and its applications"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "feedback capacity of stationary gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "exact minimum number of bits to stabilize a linear system"):
  with members:
    - "stabilizing a system with an unbounded random gain using only a finite number of bits"
    - "rate cost tradeoffs in control"

Connected through hyperedge HE-6 (induced by source paper "interplay between transmission delay average data rate and performance in output feedback control over digital communication channels"):
  with members:
    - "fundamental inequalities and identities involving mutual and directed informations in closed loop systems"

Connected through hyperedge HE-7 (induced by source paper "rate cost tradeoffs in control"):
  with members:
    - "an upper bound to zero delay rate distortion via kalman filtering for vector gaussian sources"
    - "data compression with low distortion and finite blocklength"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "nonanticipative rate distortion function and relations to filtering theory"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "a coding theorem for a class of stationary channels with feedback"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-8 (induced by source paper "rate cost tradeoffs in control part ii achievable scheme"):
  with members:
    - "rate cost tradeoffs in control"
    - "wasserstein continuity of entropy and outer bounds for interference 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.SY(Systems and Control)