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: "a comparison of stealthy sensor attacks on control systems"
  Abstract: As more attention is paid to security in the context of control systems and as attacks occur to real control systems throughout the world, it has become clear that some of the most nefarious attacks are those that evade detection. The term stealthy has come to encompass a variety of techniques that attackers can employ to avoid detection. Here we show how the states of the system (in particular, the reachable set corresponding to the attack) can be manipulated under two important types of stealthy attacks. We employ the chi-squared fault detection method and demonstrate how this imposes a constraint on the attack sequence either to generate no alarms (zero-alarm attack) or to generate alarms at a rate indistinguishable from normal operation (hidden attack).

Connected through hyperedge HE-1 (induced by source paper "on privacy of quantized sensor measurements through additive noise"):
  with members:
    - "on reachable sets of hidden cps sensor attacks"
    - "constraining attacker capabilities through actuator saturation"
    - "managing your private and public data bringing down inference attacks against your privacy"
    - "increasing smart meter privacy through energy harvesting and storage devices"
    - "the optimal mechanism in differential privacy"
    - "privacy against statistical inference"

Connected through hyperedge HE-2 (induced by source paper "a multi observer approach for attack detection and isolation of discrete time nonlinear systems"):
  with members:
    - "on privacy of quantized sensor measurements through additive noise"
    - "security metrics of networked control systems under sensor attacks extended preprint"
    - "on reachable sets of hidden cps sensor attacks"
    - "constraining attacker capabilities through actuator saturation"

Connected through hyperedge HE-3 (induced by source paper "an unknown input multi observer approach for estimation attack isolation and control of lti systems under actuator attacks"):
  with members:
    - "on privacy of quantized sensor measurements through additive noise"
    - "on reachable sets of hidden cps sensor attacks"
    - "constraining attacker capabilities through actuator saturation"

Connected through hyperedge HE-4 (induced by source paper "security metrics of networked control systems under sensor attacks extended preprint"):
  with members:
    - "estimating the impact of cyber attack strategies for stochastic control systems"
    - "on reachable sets of hidden cps sensor attacks"
    - "constraining attacker capabilities through actuator saturation"

Connected through hyperedge HE-5 (induced by source paper "on reachable sets of hidden cps sensor attacks"):
  with members:
    - "constraining attacker capabilities through actuator saturation"
    - "design time quantification of integrity in cyber physical systems"

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)