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 continuous time consensus in fractional robust networks"
  Abstract: In this paper, we study the continuous-time consensus problem in the presence of adversaries. The networked multi-agent system is modeled as a switched system, where the normal agents have integrator dynamics and the switching signal determines the topology of the network. We consider several models of omniscient adversaries under the assumption that at most a fraction of any normal agent's neighbors may be adversaries. Under this fractional assumption on the interaction between normal and adversary agents, we show that a novel graph theoretic metric, called fractional robustness, is useful for analyzing the network topologies under which the normal agents achieve consensus.

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"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "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"

Connected through hyperedge HE-2 (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"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "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"
    - "iterative approximate byzantine consensus under a generalized fault model"

Connected through hyperedge HE-3 (induced by source paper "finite time resilient formation control with bounded inputs"):
  with members:
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "resilient leader follower consensus to arbitrary reference values"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "consensus of multi agent networks in the presence of adversaries using only local information"

Connected through hyperedge HE-4 (induced by source paper "resilient leader follower consensus to arbitrary reference values"):
  with members:
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "r robustness and r s robustness of circulant graphs"
    - "robustness of information diffusion algorithms to locally bounded adversaries"

Connected through hyperedge HE-5 (induced by source paper "r robustness and r s robustness of circulant graphs"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "on connectivity and robustness in random intersection graphs"
    - "resilient randomized quantized consensus"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "consensus of multi agent networks in the presence of adversaries using only local information"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "robustness of complex networks with implications for consensus and contagion"
    - "robustness of information diffusion algorithms to locally bounded adversaries"

Connected through hyperedge HE-6 (induced by source paper "on connectivity and robustness in random intersection graphs"):
  with members:
    - "k connectivity in random key graphs with unreliable links"
    - "on the strengths of connectivity and robustness in general random intersection graphs"
    - "performance of the eschenauer gligor key distribution scheme under an on off channel"
    - "robustness of complex networks with implications for consensus and contagion"
    - "robustness of information diffusion algorithms to locally bounded adversaries"
    - "component evolution in general random intersection graphs"

Connected through hyperedge HE-7 (induced by source paper "random intersection graphs and their applications in security wireless communication and social networks"):
  with members:
    - "k connectivity in random key graphs with unreliable links"
    - "designing securely and reliably connected wireless sensor networks"
    - "connectivity in secure wireless sensor networks under transmission constraints"
    - "on topological properties of wireless sensor networks under the q composite key predistribution scheme with on off channels"
    - "on the strengths of connectivity and robustness in general random intersection graphs"
    - "the phase transition in inhomogeneous random intersection graphs"
    - "k connectivity in secure wireless sensor networks with physical link constraints the on off channel model"
    - "performance of the eschenauer gligor key distribution scheme under an on off channel"

Connected through hyperedge HE-8 (induced by source paper "on the strengths of connectivity and robustness in general random intersection graphs"):
  with members:
    - "connectivity in secure wireless sensor networks under transmission constraints"
    - "on topological properties of wireless sensor networks under the q composite key predistribution scheme with on off channels"
    - "the phase transition in inhomogeneous random intersection graphs"
    - "k connectivity in secure wireless sensor networks with physical link constraints the on off channel model"
    - "robustness of complex networks with implications for consensus and contagion"
    - "robustness of information diffusion algorithms to locally bounded adversaries"
    - "component evolution in general random intersection 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)