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 randomized quantized consensus"
  Abstract: We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication links. The goal of the healthy normal agents is to form consensus in their state values, which may be disturbed by the non-normal, malicious agents. We develop update schemes to be equipped by the normal agents whose interactions are asynchronous and subject to non-uniform and time-varying time delays. In particular, we employ a variant of the so-called mean subsequence reduced (MSR) algorithms, which have been long studied in computer science, where each normal agent ignores extreme values from its neighbors. We solve the resilient quantized consensus problems in the presence of totally/locally bounded adversarial agents and provide necessary and sufficient conditions in terms of the connectivity notion of graph robustness. Furthermore, it will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner. The results are examined through a numerical example.

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"
    - "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:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "on connectivity and robustness in random intersection graphs"
    - "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 consensus of second order agent networks asynchronous update rules with delays"

Connected through hyperedge HE-4 (induced by source paper "resilient consensus for multi agent systems subject to differential privacy requirements"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "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-5 (induced by source paper "randomized transmission protocols for protection against jamming attacks in multi agent consensus"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "analysis of stochastic switched systems with application to networked control under jamming attacks"
    - "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-6 (induced by source paper "resilient consensus through asynchronous event based communication"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "r robustness and r s robustness of circulant graphs"
    - "distributed optimization under adversarial nodes"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

Connected through hyperedge HE-7 (induced by source paper "attack analysis and resilient control design for discrete time distributed multi agent systems"):
  with members:
    - "resilient active target tracking with multiple robots"
    - "resilient leader follower consensus to arbitrary reference values"
    - "interdependent security games on networks under behavioral probability weighting"
    - "consensus of multi agent networks in the presence of adversaries using only local information"

Connected through hyperedge HE-8 (induced by source paper "resilience against misbehaving nodes in asynchronous networks"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "r robustness and r s robustness of circulant graphs"
    - "robust self triggered coordination with ternary controllers"

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)