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: "freeform assembly planning"
  Abstract: 3D printing enables the fabrication of complex architectures by automating long sequences of additive steps. The increasing sophistication of printers, materials, and generative design promises to make geometric complexity a non-issue in manufacturing; however, this complexity can only be realized if a design can be translated into a physically executable sequence of printing operations. We investigate this planning problem for freeform direct-write assembly, in which filaments of material are deposited through a nozzle translating along a 3D path to create sparse, frame-like structures. We enumerate the process constraints for different variants of the freeform assembly process and show that, in the case where material stiffens via a glass transition, determining whether a feasible sequence exists is NP-complete. Nonetheless, for topologies typically encountered in real-world applications, finding a feasible or even optimal sequence is a tractable problem. We develop a sequencing algorithm that maximizes the fidelity of the printed part and minimizes the probability of print failure by modeling the assembly as a linear, elastic frame. We implement the algorithm and validate our approach experimentally, printing objects composed of thousands of sugar alcohol filaments with diameters of 100-200 microns. The assembly planner allows the freeform process to be applied to arbitrarily complex parts, from tissue engineering and microfluidics at the micrometer scale, to vascularized functional materials and soft robots at the millimeter scale, to structural components at the meter scale, thus opening a variety of assembly possibilities.

Connected through hyperedge HE-1 (induced by source paper "scalable and probabilistically complete planning for robotic spatial extrusion"):
  with members:
    - "automated sequence and motion planning for robotic spatial extrusion of 3d trusses"
    - "sampling based methods for factored task and motion planning"
    - "probabilistic completeness of rrt for geometric and kinodynamic planning with forward propagation"
    - "complexity results and fast methods for optimal tabletop rearrangement with overhand grasps"
    - "backward forward search for manipulation planning"
    - "sampling based algorithms for optimal motion planning"
    - "the fast downward planning system"

Connected through hyperedge HE-2 (induced by source paper "automated sequence and motion planning for robotic spatial extrusion of 3d trusses"):
  with members:
    - "sampling based methods for factored task and motion planning"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "reuleaux robot base placement by reachability analysis"
    - "mobile robotic fabrication at 1 1 scale the in situ fabricator"
    - "sampling based algorithms for optimal motion planning"
    - "the fast downward planning system"

Connected through hyperedge HE-3 (induced by source paper "automated motion planning for robotic assembly of discrete architectural structures"):
  with members:
    - "sampling based methods for factored task and motion planning"
    - "reuleaux robot base placement by reachability analysis"
    - "mobile robotic fabrication at 1 1 scale the in situ fabricator"
    - "sampling based algorithms for optimal motion planning"
    - "the fast downward planning system"

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.CE(Computational Engineering, Finance, and Science)