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: "maximum hands off control a paradigm of control effort minimization"
  Abstract: In this paper, we propose a paradigm of control, called a maximum hands-off control. A hands-off control is defined as a control that has a short support per unit time. The maximum hands-off control is the minimum support (or sparsest) per unit time among all controls that achieve control objectives. For finite horizon continuous-time control, we show the equivalence between the maximum hands-off control and    $L^{1}$  -optimal control under a uniqueness assumption called normality. This result rationalizes the use of    $L^{1}$   optimality in computing a maximum hands-off control. The same result is obtained for discrete-time hands-off control. We also propose an    $L^{1}/L^{2}$  -optimal control to obtain a smooth hands-off control. Furthermore, we give a self-triggered feedback control algorithm for linear time-invariant systems, which achieves a given sparsity rate and practical stability in the case of plant disturbances. An example is included to illustrate the effectiveness of the proposed control.

Connected through hyperedge HE-1 (induced by source paper "learning based intelligent attack against mobile robots with obstacle avoidance"):
  with members:
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

Connected through hyperedge HE-2 (induced by source paper "continuous hands off control by clot norm minimization"):
  with members:
    - "characterization of maximum hands off control"
    - "sparse packetized predictive control for networked control over erasure channels"

Connected through hyperedge HE-3 (induced by source paper "a jammer s perspective of reachability and lq optimal control"):
  with members:
    - "value function in maximum hands off control"
    - "hands off control as green control"

Connected through hyperedge HE-4 (induced by source paper "characterization of maximum hands off control"):
  with members:
    - "sparse packetized predictive control for networked control over erasure channels"

Connected through hyperedge HE-5 (induced by source paper "maximum hands off control without normality assumption"):
  with members:
    - "characterization of maximum hands off control"
    - "discrete valued control by sum of absolute values optimization"
    - "continuity of the value function in sparse optimal control"
    - "hands off control as green control"

Connected through hyperedge HE-6 (induced by source paper "discrete valued control by sum of absolute values optimization"):
  with members:
    - "discrete signal reconstruction by sum of absolute values"
    - "continuity of the value function in sparse optimal control"

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)