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: "on the computation of worst attacks a lp framework"
  Abstract: We consider the problem of false data injection attacks modeled as additive disturbances in various parts of a general LTI feedback system and derive necessary and sufficient conditions for the existence of stealthy unbounded attacks. We also consider the problem of characterizing the worst, bounded and stealthy attacks. This problem involves a maximization of a convex function subject to convex constraints, and hence, in principle, it is not easy to solve. However, by employing a $\ell_\infty$ framework, we show how tractable Linear Programming (LP) methods can be used to obtain the worst attack design. Moreover, we provide a controller synthesis iterative method to minimize the worst impact of such attacks.

Connected through hyperedge HE-1 (induced by source paper "estimating the impact of cyber attack strategies for stochastic control systems"):
  with members:
    - "security metrics of networked control systems under sensor attacks extended preprint"
    - "tuning windowed chi squared detectors for sensor attacks"

Connected through hyperedge HE-2 (induced by source paper "strategic topology switching for security part ii detection switching topologies"):
  with members:
    - "disabling external influence in social networks via edge recommendation"
    - "strategic topology switching for security part i consensus switching times"

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)