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 "how many cooks spoil the soup"):
  Abstract: In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of speed, but in terms of identical roles that processes have at the same time in the execution. We initiate this study in population protocols, a very simple model that not only allows for a straightforward definition of what a role is, but also encloses the challenge of isolating the properties that are due to the protocol from those that are due to the adversary scheduler, who controls the interactions between the processes. We (i) give a partial characterization of the set of predicates on input assignments that can be stably computed with maximum symmetry, i.e., $\Theta(N_{min})$, where $N_{min}$ is the minimum multiplicity of a state in the initial configuration, and (ii) we turn our attention to the remaining predicates and prove a strong impossibility result for the parity predicate: the inherent symmetry of any protocol that stably computes it is upper bounded by a constant that depends on the size of the protocol.

Includes members:
  Member "terminating distributed construction of shapes and patterns in a fair solution of automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "on convergence and threshold properties of discrete lotka volterra population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on analog models of computation")
  Member "stable leader election in population protocols requires linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constructive expressive power of population protocols")
  Member "netcs a new simulator of population protocols and network constructors":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connectivity preserving network transformers")
  Member "simple and efficient local codes for distributed stable network construction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "leaderless deterministic chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "composable computation in discrete chemical reaction networks")
  Member "timing in chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication cost of consensus for nodes with limited memory")
  Member "deterministic function computation with chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed voting in beep model")

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)