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 "fast convergence of quantized consensus using metropolis chains over static and dynamic networks"):
  Abstract: We consider the quantized consensus problem on undirected connected graphs with n nodes, and devise a pro- tocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of a static network are activated based on Poisson processes with Metropolis rates, the expected convergence time to the set of consensus points is at most O(n 2 logn). We further show an upper bound of O(n 2 log 2 n) for the expected convergence time of the same protocol over connected time-varying networks. These bounds are better than all previous convergence times for randomized quantized consensus. Index Terms— Quantized consensus, consensus convergence time, Metropolis chains.

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 "consensus networks over finite fields":
    also connected through other hyperedges:
      (none)
  Member "an upper bound on the convergence time for distributed binary consensus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "global majority consensus by local majority polling on graphs of a given degree sequence")
  Member "convergence time analysis of quantized gossip consensus on digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "resilient randomized quantized consensus")

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)