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: "guaranteed cost tracking for uncertain coupled multi agent systems using consensus over a directed graph"
  Abstract: This paper considers the leader-follower control problem for a linear multi-agent system with directed communication topology and linear nonidentical uncertain coupling subject to integral quadratic constraints (IQCs). A consensus-type control protocol is proposed based on each agent's states relative to its neighbors and leader's state relative to agents which observe the leader. A sufficient condition is obtained by overbounding the cost function. Based on this sufficient condition, a computational algorithm is introduced to minimize the proposed guaranteed bound on tracking performance, which yields a suboptimal bound on the system consensus control and tracking performance. The effectiveness of the proposed method is demonstrated using a simulation example.

Connected through hyperedge HE-1 (induced by source paper "dynamic output feedback guaranteed cost synchronization for multiagent networks with given cost budgets"):
  with members:
    - "on almost controllability of dynamical complex networks with noises"
    - "guaranteed cost consensus for multiagent networks with lipschitz nonlinear dynamics and switching topologies"

Connected through hyperedge HE-2 (induced by source paper "gain scheduled leader follower tracking control for interconnected parameter varying systems"):
  with members:
    - "gain scheduled synchronization of parameter varying systems via relative h consensus with application to synchronization of uncertain bilinear systems"
    - "conditions for detectability in distributed consensus based observer networks"

Connected through hyperedge HE-3 (induced by source paper "leader follower tracking control with guaranteed consensus performance for interconnected systems with linear dynamic uncertain coupling"):
  with members:
    - "decentralized estimation of laplacian eigenvalues in multi agent systems"

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)