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 "tilt assembly algorithms for micro factories that build objects with uniform external forces"):
  Abstract: We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield micro-factories. The underlying model has particles moving under the influence of uniform external forces until they hit an obstacle; particles can bond when being forced together with another appropriate particle. Due to the physical and geometric constraints, not all shapes can be built in this manner; this gives rise to the Tilt Assembly Problem (TAP) of deciding constructibility. For simply-connected polyominoes $P$ in 2D consisting of $N$ unit-squares ("tiles"), we prove that TAP can be decided in $O(N\log N)$ time. For the optimization variant MaxTAP (in which the objective is to construct a subshape of maximum possible size), we show polyAPX-hardness: unless P=NP, MaxTAP cannot be approximated within a factor of $\Omega(N^{\frac{1}{3}})$; for tree-shaped structures, we give an $O(N^{\frac{1}{2}})$-approximation algorithm. For the efficiency of the assembly process itself, we show that any constructible shape allows pipelined assembly, which produces copies of $P$ in $O(1)$ amortized time, i.e., $N$ copies of $P$ in $O(N)$ time steps. These considerations can be extended to three-dimensional objects: For the class of polycubes $P$ we prove that it is NP-hard to decide whether it is possible to construct a path between two points of $P$; it is also NP-hard to decide constructibility of a polycube $P$. Moreover, it is expAPX-hard to maximize a path from a given start point.

Includes members:
  Member "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the parameterized complexity of motion planning for snake like robots")
  Member "collecting a swarm in a grid environment using shared global inputs":
    also connected through other hyperedges:
      (none)
  Member "universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "optimal staged self assembly of general shapes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "verification in staged tile self assembly")
  Member "new geometric algorithms for fully connected staged self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "an algorithmic framework for shape formation problems in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "particle computation designing worlds to control robot swarms with only global signals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "particle computation complexity algorithms and logic")
  Member "crowdsourcing swarm manipulation experiments a massive online user study with large swarms of simple robots":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "steering a particle swarm using global inputs and swarm statistics")

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.DS(Data Structures and Algorithms)