human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "particle computation designing worlds to control robot swarms with only global signals"
  Abstract: Micro- and nanorobots are often controlled by global input signals, such as an electromagnetic or gravitational field. These fields move each robot maximally until it hits a stationary obstacle or another stationary robot. This paper investigates 2D motion-planning complexity for large swarms of simple mobile robots (such as bacteria, sensors, or smart building material). #R##N#In previous work we proved it is NP-hard to decide whether a given initial configuration can be transformed into a desired target configuration; in this paper we prove a stronger result: the problem of finding an optimal control sequence is PSPACE-complete. On the positive side, we show we can build useful systems by designing obstacles. We present a reconfigurable hardware platform and demonstrate how to form arbitrary permutations and build a compact absolute encoder. We then take the same platform and use dual-rail logic to build a universal logic gate that concurrently evaluates AND, NAND, NOR and OR operations. Using many of these gates and appropriate interconnects we can evaluate any logical expression.

Connected through hyperedge HE-1 (induced by source paper "tilt assembly algorithms for micro factories that build objects with uniform external forces"):
  with members:
    - "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch"
    - "collecting a swarm in a grid environment using shared global inputs"
    - "universal coating for programmable matter"
    - "optimal staged self assembly of general shapes"
    - "new geometric algorithms for fully connected staged self assembly"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "crowdsourcing swarm manipulation experiments a massive online user study with large swarms of simple robots"
    - "two hands are better than one up to constant factors"

Connected through hyperedge HE-2 (induced by source paper "particle computation complexity algorithms and logic"):
  with members:
    - "universal computation with arbitrary polyomino tiles in non cooperative self assembly"
    - "intrinsic universality in tile self assembly requires cooperation"
    - "limitations of self assembly at temperature 1"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"
    - "playing games with algorithms algorithmic combinatorial game theory"
    - "pushpush and push 1 are np hard in 2d"

Question: Please tell me which class the center node 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.RO(Robotics)