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: "robust stability of discrete time disturbance observers understanding interplay of sampling model uncertainty and discrete time designs"
  Abstract: In this paper, we address the problem of robust stability for uncertain sampled-data systems controlled by a discrete-time disturbance observer (DT-DOB). Unlike most of previous works that rely on the small-gain theorem, our approach is to investigate the location of the roots of the characteristic polynomial when the sampling is performed sufficiently fast. This approach provides a generalized framework for the stability analysis in the sense that (i) many popular discretization methods are taken into account; (ii) under fast sampling, the obtained robust stability condition is necessary and sufficient except in a degenerative case; and (iii) systems of arbitrary order and of large uncertainty can be dealt with. The relation between sampling zeros---discrete-time zeros that newly appear due to the sampling---and robust stability is highlighted, and it is explicitly revealed that the sampling zeros can hamper stability of the overall system when the Q-filter and/or the nominal model are carelessly selected in discrete time. Finally, a design guideline for the Q-filter and the nominal model in the discrete-time domain is proposed for robust stabilization under the sampling against the arbitrarily large (but bounded) parametric uncertainty of the plant.

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)