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: "convergence time analysis of quantized gossip consensus on digraphs"
  Abstract: We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms. To this end, we investigate the shrinking time of the smallest interval that contains all states for the consensus algorithm, and the decay time of a suitable Lyapunov function for the averaging algorithm. The investigation leads us to characterizing the convergence time by the hitting time in certain special Markov chains. We simplify the structures of state transition by considering the special case of complete graphs, where every edge can be activated with an equal probability, and derive polynomial upper bounds on convergence time.

Connected through hyperedge HE-1 (induced by source paper "resilient randomized quantized consensus"):
  with members:
    - "convergence time for unbiased quantized consensus over static and dynamic networks"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "on the strengths of connectivity and robustness in general random intersection graphs"
    - "ergodic randomized algorithms and dynamics over networks"
    - "distributed randomized algorithms for the pagerank computation"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "distributed consensus algorithms in sensor networks quantized data and random link failures"

Connected through hyperedge HE-2 (induced by source paper "fast convergence of quantized consensus using metropolis chains over static and dynamic networks"):
  with members:
    - "convergence time for unbiased quantized consensus over static and dynamic networks"
    - "consensus networks over finite fields"
    - "an upper bound on the convergence time for distributed binary consensus"

Connected through hyperedge HE-3 (induced by source paper "convergence time of quantized metropolis consensus over time varying networks"):
  with members:
    - "convergence time for unbiased quantized consensus over static and dynamic networks"
    - "an upper bound on the convergence time for distributed binary consensus"

Connected through hyperedge HE-4 (induced by source paper "minimizing convergence error in multi agent systems via leader selection a supermodular optimization approach"):
  with members:
    - "a supermodular optimization framework for leader selection under link noise in linear multi agent systems"
    - "opinion dynamics in social networks a local interaction game with stubborn agents"
    - "weight optimization for consensus algorithms with correlated switching topology"

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)