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: "order reduction abstractions for safety verification of high dimensional linear systems"
  Abstract: Order-reduction is a standard automated approximation technique for computer-aided design, analysis, and simulation of many classes of systems, from circuits to buildings. For a given system, these methods produce a reduced-order system where the dimension of the state-space is smaller, while attempting to preserve behaviors similar to those of the full-order original system. To be used as a sound abstraction for formal verification, a measure of the similarity of behavior must be formalized and computed, which we develop in a computational way for a class of linear systems and periodically-switched systems as the main contributions of this paper. We have implemented the order-reduction as a sound abstraction process through a source-to-source model transformation in the HyST tool and use SpaceEx to compute sets of reachable states to verify properties of the full-order system through analysis of the reduced-order system. Our experimental results suggest systems with on the order of a thousand state variables can be reduced to systems with tens of state variables such that the order-reduction overapproximation error is small enough to prove or disprove safety properties of interest using current reachability analysis tools. Our results illustrate this approach is effective to alleviate the state-space explosion problem for verification of high-dimensional linear systems.

Connected through hyperedge HE-1 (induced by source paper "numerical verification of affine systems with up to a billion dimensions"):
  with members:
    - "reach set approximation through decomposition with low dimensional sets and high dimensional matrices"
    - "reachability analysis of large linear systems with uncertain inputs in the krylov subspace"
    - "hamilton jacobi reachability a brief overview and recent advances"
    - "an efficient algorithm for vertex enumeration of two dimensional projection of polytopes"
    - "bounded verification with on the fly discrepancy computation"

Connected through hyperedge HE-2 (induced by source paper "real time verification for distributed cyber physical systems"):
  with members:
    - "starl towards a unified framework for programming simulating and verifying distributed robotic systems"

Connected through hyperedge HE-3 (induced by source paper "reach set approximation through decomposition with low dimensional sets and high dimensional matrices"):
  with members:
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "julia a fresh approach to numerical computing"

Connected through hyperedge HE-4 (induced by source paper "reachability analysis of large linear systems with uncertain inputs in the krylov subspace"):
  with members:
    - "parallel reachability analysis for hybrid 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)