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: "detection and mitigation of classes of attacks in supervisory control systems"
  Abstract: The deployment of control systems with network-connected components has made feedback control systems vulnerable to attacks over the network. This paper considers the problem of intrusion detection and mitigation in supervisory control systems, where the attacker has the ability to enable or disable vulnerable actuator commands and erase or insert vulnerable sensor readings. We present a mathematical model for the system under certain classes of actuator enablement attacks, sensor erasure attacks, or sensor insertion attacks. We then propose a defense strategy that aims to detect such attacks online and disables all controllable events after an attack is detected. We develop an algorithmic procedure for verifying whether the system can prevent damage from the attacks considered with the proposed defense strategy, where damage is modeled as the reachability of a pre-defined set of unsafe system states.The technical condition of interest that is necessary and sufficient in this context, termed "GF-safe controllability", is characterized. We show that the verification of GF-safe controllability can be performed using diagnoser or verifier automata. Finally, we illustrate the methodology with a traffic control system example.

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"
    - "supervisory control of discrete event systems under attacks"
    - "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"
    - "supervisory control of discrete event systems under attacks"
    - "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:
    - "supervisory control of discrete event systems under attacks"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

Connected through hyperedge HE-4 (induced by source paper "cyber attacks with bounded sensor reading edits for partially observed discrete event systems"):
  with members:
    - "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.FL(Formal Languages and Automata Theory)