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 "connected assembly and reconfiguration by finite automata"):
  Abstract: We consider methods for connected reconfigurations by finite automate in the so-called \emph{hybrid} or \emph{Robot-on-Tiles} model of programmable matter, in which a number of simple robots move on and rearrange an arrangement of passive tiles in the plane that form \emph{polyomino} shapes, making use of a supply of additional tiles that can be placed. We investigate the problem of reconfiguration under the constraint of maintaining connectivity of the tile arrangement; this reflects scenarios in which disconnected subarrangements may drift apart, e.g., in the absence of gravity in space. We show that two finite automata suffice to mark a bounding box, which can then be used as a stepping stone for more complex operations, such as scaling a tile arrangement by a given factor, rotating arrangements, or copying arrangements to a different location. We also describe an algorithm for scaling monotone polyominoes without the help of a bounding box.

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 "cadbots algorithmic aspects of manipulating programmable matter with finite automata":
    also connected through other hyperedges:
      (none)
  Member "shape formation by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "new geometric algorithms for fully connected staged self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient parallel self assembly under uniform control inputs")
  Member "an algorithmic framework for shape formation problems in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "leader election and shape formation with self organizing programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.CG(Computational Geometry)