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: "resilient consensus of second order agent networks asynchronous update rules with delays"
  Abstract: We study the problem of resilient consensus of sampled-data multi-agent networks with double-integrator dynamics. The term resilient points to algorithms considering the presence of attacks by faulty/malicious agents in the network. Each normal agent updates its state based on a predetermined control law using its neighbors' information which may be delayed while misbehaving agents make updates arbitrarily and might threaten the consensus within the network. Assuming that the maximum number of malicious agents in the system is known, we focus on algorithms where each normal agent ignores large and small position values among its neighbors to avoid being influenced by malicious agents. The malicious agents are assumed to be omniscient in that they know the updating times and delays and can collude with each other. We deal with both synchronous and partially asynchronous cases with delayed information and derive topological conditions in terms of graph robustness.

Connected through hyperedge HE-1 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming"):
  with members:
    - "determining r robustness of arbitrary digraphs using zero one linear integer programming"
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "on connectivity and robustness in random intersection graphs"
    - "resilient randomized quantized consensus"
    - "r robustness and r s robustness of circulant graphs"
    - "distributed optimization under adversarial nodes"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "asynchronous convex consensus in the presence of crash faults"

Connected through hyperedge HE-2 (induced by source paper "resilient consensus through event based communication"):
  with members:
    - "on connectivity and robustness in random intersection graphs"
    - "resilient randomized quantized consensus"
    - "a jamming resilient algorithm for self triggered network coordination"
    - "distributed optimization under adversarial nodes"
    - "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

Connected through hyperedge HE-3 (induced by source paper "a filtering approach for resiliency of distributed observers against smart spoofers"):
  with members:
    - "byzantine resilient distributed observers for lti systems"
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "on the limited communication analysis and design for decentralized estimation"
    - "resilient randomized quantized consensus"

Connected through hyperedge HE-4 (induced by source paper "resilient coordinated movement of connected autonomous vehicles"):
  with members:
    - "cooperative look ahead control for fuel efficient and safe heavy duty vehicle platooning"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

Connected through hyperedge HE-5 (induced by source paper "resilient consensus for multi agent systems subject to differential privacy requirements"):
  with members:
    - "resilient randomized quantized consensus"
    - "r robustness and r s robustness of circulant graphs"
    - "exploiting nodes symmetries to control synchronization and consensus patterns in multiagent systems"
    - "a jamming resilient algorithm for self triggered network coordination"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "differentially private distributed optimization"
    - "differentially private iterative synchronous consensus"
    - "calibrating data to sensitivity in private data analysis"

Connected through hyperedge HE-6 (induced by source paper "determining r robustness of arbitrary digraphs using zero one linear integer programming"):
  with members:
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "on connectivity and robustness in random intersection graphs"
    - "distributed optimization under adversarial nodes"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "byzantine vector consensus in complete graphs"
    - "resilient continuous time consensus in fractional robust networks"
    - "iterative approximate byzantine consensus under a generalized fault model"

Connected through hyperedge HE-7 (induced by source paper "randomized transmission protocols for protection against jamming attacks in multi agent consensus"):
  with members:
    - "analysis of stochastic switched systems with application to networked control under jamming attacks"
    - "resilient randomized quantized consensus"
    - "resilient control under denial of service robust design"
    - "a jamming resilient algorithm for self triggered network coordination"
    - "networked control under random and malicious packet losses"
    - "self triggered coordination over a shared network under denial of service"
    - "robust self triggered coordination with ternary controllers"

Connected through hyperedge HE-8 (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"
    - "detection of biasing attacks on distributed estimation networks"
    - "distributed observers for lti systems"
    - "byzantine multi agent optimization part ii"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

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)