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: "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"
  Abstract: One of the major challenges about cyber physical systems is how to prevent cyber attacks to ensure system integrity. There has been a large number of different types of attacks discussed in the modern control and computer science communities. In this paper we aim to investigate one special type of attacks in the discrete-event system framework, where an attacker can arbitrarily alter sensor readings after intercepting them from a target system in order to trick a given supervisor to issue control commands improperly, driving the system to an undesirable state. We first consider the cyber attack problem from an attacker point of view, and formulate an attack with bounded sensor reading alterations (ABSRA) problem. We then show that the supremal (or least restrictive) ABSRA exists and can be synthesized, as long as the plant model and the supervisor model are regular, i.e., representable by finite-state automata. Upon the synthesis of the supremal ABSRA, we present a synthesis algorithm, which ensures that a computed supervisor will be ABSRA-robust , i.e., either an ABSRA will be detectable or will not lead the system to an undesirable state.

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"
    - "supervisory control of discrete event systems under attacks"
    - "a formal approach to cyber physical attacks"

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"
    - "supervisory control of discrete event systems under attacks"
    - "a formal approach to cyber physical attacks"

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"
    - "supervisory control of discrete event systems under attacks"

Connected through hyperedge HE-4 (induced by source paper "cyber attacks with bounded sensor reading edits for partially observed discrete event systems"):
  with members:
    - "detection and mitigation of classes of attacks in supervisory control systems"

Connected through hyperedge HE-5 (induced by source paper "learning based intelligent attack against mobile robots with obstacle avoidance"):
  with members:
    - "maximum hands off control a paradigm of control effort minimization"

Connected through hyperedge HE-6 (induced by source paper "supervisor obfuscation against actuator enablement attack"):
  with members:
    - "synthesis of successful actuator attackers on supervisors"
    - "supervisory control of discrete event systems under attacks"
    - "implementing efficient all solutions sat solvers"
    - "a formal approach to cyber physical attacks"

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)