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 "mobile ram and shape formation by programmable particles"):
  Abstract: We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-state machines that operate and move on an hexagonal tasselation of the plane. In this paper we show how a constant number of such weak particles can simulate a powerful Turing-complete entity that is able to move on the plane while computing. We then show an application of our tool to the classical Shape-Formation problem, providing a new and much more general distributed solution protocol. Indeed, the existing algorithms would allow to form only shapes made of arrangements of segments and triangles. Our algorithm allows the particles to form more abstract and general connected shapes, including circles and spirals, as well as fractal objects of non-integer dimension, such as the Sierpinski triangle or the Koch snowflake. In lieu of the existing limitation on the formability of a shape depending on the symmetry of the initial configuration of the particles, our result provides a complete characterization of the connected shapes that can be formed by an initially simply connected set of particles. Furthermore, in the case of non-connected shapes, we give almost-matching necessary and sufficient conditions for their formability.

Includes members:
  Member "a stochastic approach to shortcut bridging in programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "on the runtime of universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "on the transformation capability of feasible mechanisms for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots")
  Member "line recovery by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "synchronous byzantine lattice agreement in o log f rounds")
  Member "shape formation by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "fault tolerant network constructors")

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)