human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "convergence time for unbiased quantized consensus over static and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robotic surveillance based on the meeting time of random walks")
  Member "robustness and algebraic connectivity of random interdependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "on the strengths of connectivity and robustness in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "ergodic randomized algorithms and dynamics over networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "opinion dynamics on correlated subjects in social networks")
  Member "distributed randomized algorithms for the pagerank computation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a tutorial on modeling and analysis of dynamic social networks part i")
  Member "iterative approximate byzantine consensus in arbitrary directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")
  Member "convergence time analysis of quantized gossip consensus on digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast convergence of quantized consensus using metropolis chains over static and dynamic networks")
  Member "distributed consensus algorithms in sensor networks quantized data and random link failures":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fully decentralized multi agent reinforcement learning with networked agents")

Question: Please tell me which class the source paper 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)