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: "supervisory control of discrete event systems under attacks"
  Abstract: We consider a supervisory control problem for discrete-event systems, in which an attacker corrupts the symbols that are observed by the supervisor. We show that existence of a supervisor enforcing a specification language, in the presence of attacks, is completely characterized by controllability (in the usual sense) and observability of the specification (in a new appropriately defined sense). The new notion of observability takes into account the attacker's ability to alter the symbols received by the attacker. For attacks that correspond to arbitrary insertions/removals of symbols, the new notion of observability can be tested by checking the usual notion of observability for a set of discrete-event systems with appropriately redefined observation maps. Focusing on attacks that replace and/or remove symbols from the output strings, we construct observers that are robust against attacks and lead to an automaton representation of the supervisor. We also develop a test for observability under such replacement-removal attacks by using the so-called product automata.

Connected through hyperedge HE-1 (induced by source paper "synthesis of actuator attackers for free"):
  with members:
    - "attack resilient supervisory control of discrete event systems"
    - "towards bounded synthesis of resilient supervisors against actuator attacks"
    - "supervisor obfuscation against actuator enablement attack"
    - "detection and mitigation of classes of attacks in supervisory control systems"
    - "a formal approach to cyber physical attacks"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

Connected through hyperedge HE-2 (induced by source paper "towards bounded synthesis of resilient supervisors against actuator attacks"):
  with members:
    - "synthesis of successful actuator attackers on supervisors"
    - "supervisor obfuscation against actuator enablement attack"
    - "detection and mitigation of classes of attacks in supervisory control systems"
    - "a formal approach to cyber physical attacks"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

Connected through hyperedge HE-3 (induced by source paper "attack resilient supervisory control of discrete event systems"):
  with members:
    - "detection and mitigation of classes of attacks in supervisory control systems"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

Connected through hyperedge HE-4 (induced by source paper "supervisor obfuscation against actuator enablement attack"):
  with members:
    - "synthesis of successful actuator attackers on supervisors"
    - "implementing efficient all solutions sat solvers"
    - "a formal approach to cyber physical attacks"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

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)