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 "self stabilizing clock synchronization with 3 bit messages"):
  Abstract: This paper studies the complexities of basic distributed computing tasks while operating under severe fault-tolerant contexts and strong communication constraints. We consider the self-stabilizing context, in which internal states of processors (agents) are initially chosen by an adversary. Given a population of $n$ agents, we assume that communication is restricted to the synchronous PULL model, where in each round, each agent can pull information from few other agents, chosen uniformly at random. We are primarily interested in the design of algorithms that use messages as small as possible. Indeed, in such models, restricting the message-size may have a profound impact on both the solvability of the problem and its running time. We concentrate on variants of two fundamental problems, namely, clock-synchronization, where agents aim to synchronize their clocks modulo some $T$, and Zealot-consensus, in which agents need to agree on a common output bit, despite the presence of at most one agent whose output bit is fixed throughout the execution. #R##N#Our main technical contribution is the construction of a clock-synchronization protocol that converges in $\tilde{\mathcal O}(\log^2T\log n)$ rounds with high probability and uses only 3 bits per message. In addition to being self-stabilizing, this protocol is robust to the presence of $\mathcal O(n^{1/2-\varepsilon})$ Byzantine agents, for any positive constant~$\varepsilon$. Using this clock-synchronization protocol, we solve the self-stabilizing Zealot-consensus problem in time $\tilde{\mathcal O}(\log n)$ using only 4-bit messages. Our technique for obtaining the clock synchronization is rather general and can be applied to a large family of models where agents are passively mobile, provided that there exists a self-stabilizing symmetric-consensus protocol defined for a single bit.

Includes members:
  Member "minimizing message size in stochastic communication patterns fast self stabilizing protocols with 3 bits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed community detection via metastability of the 2 choices dynamics")
  Member "noisy information spreading and plurality consensus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "noisy rumor spreading and plurality consensus")
  Member "self stabilizing repeated balls into bins":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight load balancing via randomized local search")
  Member "towards optimal synchronous counting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self stabilising byzantine clock synchronisation is almost as easy as consensus")
  Member "stable leader election in population protocols requires linear time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructive expressive power of population protocols")
  Member "stabilizing consensus with many opinions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the necessary memory to compute the plurality in multi agent systems")
  Member "plurality consensus in the gossip model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed voting in beep model")
  Member "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "noidy conmunixatipn on the convergence of the averaging population protocol")

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.DC(Distributed, Parallel, and Cluster Computing)