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 of biasing attacks on distributed estimation networks"
  Abstract: The paper addresses the problem of detecting attacks on distributed estimator networks that aim to intentionally bias process estimates produced by the network. It provides a sufficient condition, in terms of the feasibility of certain linear matrix inequalities, which guarantees distributed input attack detection using an $H_\infty$ approach.

Connected through hyperedge HE-1 (induced by source paper "detection and mitigation of biasing attacks on distributed estimation networks"):
  with members:
    - "byzantine resilient distributed observers for lti systems"
    - "controller jammer game models of denial of service in control systems operating over packet dropping links"
    - "distributed observers for lti systems"
    - "gain scheduled synchronization of parameter varying systems via relative h consensus with application to synchronization of uncertain bilinear systems"
    - "detectability of distributed consensus based observer networks an elementary analysis and extensions"
    - "on the genericity properties in distributed estimation topology design and sensor placement"
    - "conditions for detectability in distributed consensus based observer networks"

Connected through hyperedge HE-2 (induced by source paper "byzantine resilient distributed observers for lti systems"):
  with members:
    - "a distributed observer for a time invariant linear system"
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "detection and mitigation of biasing attacks on distributed estimation networks"
    - "distributed observers for lti systems"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "distributing the kalman filter for large scale systems"

Connected through hyperedge HE-3 (induced by source paper "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"):
  with members:
    - "a distributed observer for a time invariant linear system"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "distributed observers for lti systems"
    - "byzantine multi agent optimization part ii"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

Connected through hyperedge HE-4 (induced by source paper "resilient distributed h_ infty estimation via dynamic rejection of biasing attacks"):
  with members:
    - "minimum energy distributed filtering"
    - "conditions for detectability in distributed consensus based observer networks"

Connected through hyperedge HE-5 (induced by source paper "robust detection of biasing attacks on misappropriated distributed observers via decentralized h_ infty synthesis"):
  with members:
    - "gain scheduled synchronization of parameter varying systems via relative h consensus with application to synchronization of uncertain bilinear systems"
    - "minimum energy distributed filtering"
    - "distributed robust estimation over randomly switching networks using h consensus"

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)