human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "deterministic and randomized actuator scheduling with guaranteed performance bounds"):
  Abstract: In this paper, we investigate the problem of actuator selection for linear dynamical systems. We develop a framework to design a sparse actuator/sensor schedule for a given large-scale linear system with guaranteed performance bounds using deterministic polynomial-time and randomized approximately linear-time algorithms. We first introduce systemic controllability metrics for linear dynamical systems that are monotone, convex, and homogeneous with respect to the controllability Gramian. We show that several popular and widely used optimization criteria in the literature belong to this class of controllability metrics. Our main result is to provide a polynomial-time actuator schedule that on average selects only a constant number of actuators at each time step, independent of the dimension, to furnish a guaranteed approximation of the controllability/observability metrics in comparison to when all actuators/sensors are in use. We illustrate the effectiveness of our theoretical findings via several numerical simulations using benchmark examples.

Includes members:
  Member "an alon boppana type bound for weighted graphs and lowerbounds for spectral sparsification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vector colorings of random ramanujan and large girth irregular graphs")
  Member "an sdp based algorithm for linear sized spectral sparsification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a spectral approach to network design")
  Member "minimal reachability is hard to approximate":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "herdability of linear systems based on sign patterns and graph structures")
  Member "structural analysis and optimal design of distributed system throttlers":
    also connected through other hyperedges:
      (none)
  Member "control principles of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonlinearity networks a 2020 vision")
  Member "graph distances and controllability of networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the trade off between controllability and robustness in networks of diffusively coupled agents")
  Member "minimal reachability problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "herding positive complex networks")
  Member "controllability metrics limitations and algorithms for complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "controllability of bandlimited graph processes over random time varying graphs")

Question: Please tell me which class the source paper 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)