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 "terminating distributed construction of shapes and patterns in a fair solution of automata"):
  Abstract: We consider a solution of automata similar to Population Protocols and Network Constructors. The automata (or nodes) move passively in a well-mixed solution and can cooperate by interacting in pairs. Every such interaction may result in an update of the local states of the nodes. Additionally, the nodes may also choose to connect to each other in order to start forming some required structure. We may think of such nodes as the smallest possible programmable pieces of matter. The model that we introduce here is a more applied version of Network Constructors, imposing physical (or geometrical) constraints on the connections. Each node can connect to other nodes only via a very limited number of local ports, therefore at any given time it has only a bounded number of neighbors. Connections are always made at unit distance and are perpendicular to connections of neighboring ports. We show that this restricted model is still capable of forming very practical 2D or 3D shapes. We provide direct constructors for some basic shape construction problems. We then develop new techniques for determining the constructive capabilities of our model. One of the main novelties of our approach, concerns our attempt to overcome the inability of such systems to detect termination. In particular, we exploit the assumptions that the system is well-mixed and has a unique leader, in order to give terminating protocols that are correct with high probability (w.h.p.). This allows us to develop terminating subroutines that can be sequentially composed to form larger modular protocols. One of our main results is a terminating protocol counting the size $n$ of the system w.h.p.. We then use this protocol as a subroutine in order to develop our universal constructors, establishing that the nodes can self-organize w.h.p. into arbitrarily complex shapes while still detecting termination of the construction.

Includes members:
  Member "on the transformation capability of feasible mechanisms for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "universal shape replicators via self assembly with attractive and repulsive forces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covert computation in self assembled circuits")
  Member "parallel computation using active self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the runtime of universal coating for programmable matter")
  Member "simple and efficient local codes for distributed stable network construction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "active self assembly of algorithmic shapes and patterns in polylogarithmic time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "ameba inspired self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinite object coating in the amoebot model")
  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)