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 "scalable and probabilistically complete planning for robotic spatial extrusion"):
  Abstract: There is increasing demand for automated systems that can fabricate 3D structures. Robotic spatial extrusion has become an attractive alternative to traditional layer-based 3D printing due to a manipulator's flexibility to print large, directionally-dependent structures. However, existing extrusion planning algorithms require a substantial amount of human input, do not scale to large instances, and lack theoretical guarantees. In this work, we present a rigorous formalization of robotic spatial extrusion planning and provide several efficient and probabilistically complete planning algorithms. The key planning challenge is, throughout the printing process, satisfying both stiffness constraints that limit the deformation of the structure and geometric constraints that ensure the robot does not collide with the structure. We show that, although these constraints often conflict with each other, a greedy backward state-space search guided by a stiffness-aware heuristic is able to successfully balance both constraints. We empirically compare our methods on a benchmark of over 40 simulated extrusion problems. Finally, we apply our approach to 3 real-world extrusion problems.

Includes members:
  Member "freeform assembly planning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automated sequence and motion planning for robotic spatial extrusion of 3d trusses")
  Member "automated sequence and motion planning for robotic spatial extrusion of 3d trusses":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rodsteward a design to assembly system for fabrication using 3d printed joints and precision cut rods")
  Member "sampling based methods for factored task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reactive navigation in partially familiar planar environments using semantic perceptual feedback")
  Member "probabilistic completeness of rrt for geometric and kinodynamic planning with forward propagation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "refined analysis of asymptotically optimal kinodynamic planning in the state cost space")
  Member "complexity results and fast methods for optimal tabletop rearrangement with overhand grasps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on rearrangement of items stored in stacks")
  Member "backward forward search for manipulation planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tethered tool manipulation planning with cable maneuvering")
  Member "sampling based algorithms for optimal motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "3d dynamic scene graphs actionable spatial perception with places objects and humans")
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "transferable task execution from pixels through deep planning domain learning")

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.RO(Robotics)