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 invariant sets computation for switched discrete time polynomial systems"
  Abstract: In this paper we systematically study the (maximal) robust invariant set generation problem for switched discrete-time polynomial systems subject to state constraints and perturbation inputs from theoretical and computational perspectives. The (maximal) robust invariant set of interest in this paper is a set of (all) states such that every possible trajectory starting from it stay inside a specified state constraint set forever regardless of actions of perturbations. We show that the maximal robust invariant set can be characterized as the zero level set of the unique bounded solution to a modified Bellman equation. Especially when there is only one subsystem in the system, the solution to the derived equation can be Lipschitz continuous. The uniqueness property of bounded solutions renders possible the gain of the maximal robust invariant set via value iteration methods. We further relax the equation into a system of inequalities and encode these inequality constraints using sum of squares decomposition for polynomials. This results in the gain of robust invariant sets by solving a single semi-definite program, which can be addressed via interior point methods in polynomial times. In this way we could obtain tractable solutions to problems more efficiently. Finally, we demonstrate our computational approaches on two illustrative examples.

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.DM(Discrete Mathematics)