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 "minimal reachability is hard to approximate"):
  Abstract: In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's initial condition to a given final state is possible. Assuming a standard complexity hypothesis, we show that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial, time.

Includes members:
  Member "minimal inputs outputs for a networked system":
    also connected through other hyperedges:
      (none)
  Member "minimal reachability problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic and randomized actuator scheduling with guaranteed performance bounds")
  Member "variable selection is hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate guarantees for dictionary learning")
  Member "minimizing convergence error in multi agent systems via leader selection a supermodular optimization approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "controllability metrics limitations and algorithms for complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "controllability of bandlimited graph processes over random time varying graphs")
  Member "optimal approximation for submodular and supermodular optimization with bounded curvature":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "regularized submodular maximization at scale")
  Member "a supermodular optimization framework for leader selection under link noise in linear multi agent systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "current flow group closeness centrality for complex networks")

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)