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 "object rearrangement with nested nonprehensile manipulation actions"):
  Abstract: This paper considers the problem of rearrangement planning, i.e finding a sequence of manipulation actions that displace multiple objects from an initial configuration to a given goal configuration. Rearrangement is a critical skill for robots so that they can effectively operate in confined spaces that contain clutter. Examples of tasks that require rearrangement include packing objects inside a bin, wherein objects need to lay according to a predefined pattern. In tight bins, collision-free grasps are often unavailable. Nonprehensile actions, such as pushing and sliding, are preferred because they can be performed using minimalistic end-effectors that can easily be inserted in the bin. Rearrangement with nonprehensile actions is a challenging problem as it requires reasoning about object interactions in a combinatorially large configuration space of multiple objects. This work revisits several existing rearrangement planning techniques and introduces a new one that exploits nested nonprehensile actions by pushing several similar objects simultaneously along the same path, which removes the need to rearrange each object individually. Experiments in simulation and using a real Kuka robotic arm show the ability of the proposed approach to solve difficult rearrangement tasks while reducing the length of the end-effector's trajectories.

Includes members:
  Member "towards robust product packing with a minimalistic end effector":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "anytime multi arm task and motion planning for pick and place of individual objects via handoffs")
  Member "inferring 3d shapes of unknown rigid objects in clutter through inverse physics reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verefine integrating object pose verification with iterative physics guided refinement")
  Member "sample efficient learning of nonprehensile manipulation policies via physics based informed state distributions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi object rearrangement with monte carlo tree search a case study on planar nonprehensile sorting")
  Member "sampling based methods for factored task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reactive navigation in partially familiar planar environments using semantic perceptual feedback")
  Member "automated motion planning for robotic assembly of discrete architectural structures":
    also connected through other hyperedges:
      (none)
  Member "ffrob leveraging symbolic planning for efficient task and motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep compositional robotic planners that follow natural language commands")
  Member "rearrangement with nonprehensile manipulation using deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "monte carlo tree search for efficient visually guided rearrangement planning")
  Member "efficient high quality stack rearrangement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on rearrangement of items stored in stacks")

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)