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 "shape formation by programmable particles"):
  Abstract: Shape formation is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter. Namely, it has been studied in the geometric Amoebot model, where the anonymous entities, called particles, operate on a hexagonal tessellation of the plane and have limited computational power (they have constant memory), strictly local interaction and communication capabilities (only with particles in neighboring nodes of the grid), and limited motorial capabilities (from a grid node to an empty neighboring node); their activation is controlled by an adversarial scheduler. Recent investigations have shown how, starting from a well-structured configuration in which the particles form a (not necessarily complete) triangle, the particles can form a large class of shapes. This result has been established under several assumptions: agreement on the clockwise direction (i.e., chirality), a sequential activation schedule, and randomization (i.e., particles can flip coins). #R##N#In this paper we provide a characterization of which shapes can be formed deterministically starting from any simply connected initial configuration of $n$ particles. As a byproduct, if randomization is allowed, then any input shape can be formed from any initial (simply connected) shape by our algorithm, provided that $n$ is large enough. #R##N#Our algorithm works without chirality, proving that chirality is computationally irrelevant for shape formation. Furthermore, it works under a strong adversarial scheduler, not necessarily sequential. We also consider the complexity of shape formation in terms of both the number of rounds and of moves performed by the particles. We prove that our solution has a complexity of $O(n^2)$ rounds and moves: this number of moves is also asymptotically optimal.

Includes members:
  Member "on the runtime of universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "on the transformation capability of feasible mechanisms for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "line recovery by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "improved leader election for self organizing programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "a markov chain algorithm for compression in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "terminating distributed construction of shapes and patterns in a fair solution of automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "an algorithmic framework for shape formation problems in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mobile ram and shape formation by programmable particles")

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)