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: "sample efficient learning of nonprehensile manipulation policies via physics based informed state distributions"
  Abstract: This paper proposes a sample-efficient yet simple approach to learning closed-loop policies for nonprehensile manipulation. Although reinforcement learning (RL) can learn closed-loop policies without requiring access to underlying physics models, it suffers from poor sample complexity on challenging tasks. To overcome this problem, we leverage rearrangement planning to provide an informative physics-based prior on the environment's optimal state-visitation distribution. Specifically, we present a new technique, Learning with Planned Episodic Resets (LeaPER), that resets the environment's state to one informed by the prior during the learning phase. We experimentally show that LeaPER significantly outperforms traditional RL approaches by a factor of up to 5X on simulated rearrangement. Further, we relax dynamics from quasi-static to welded contacts to illustrate that LeaPER is robust to the use of simpler physics models. Finally, LeaPER's closed-loop policies significantly improve task success rates relative to both open-loop controls with a planned path or simple feedback controllers that track open-loop trajectories. We demonstrate the performance and behavior of LeaPER on a physical 7-DOF manipulator in this https URL.

Connected through hyperedge HE-1 (induced by source paper "object rearrangement with nested nonprehensile manipulation actions"):
  with members:
    - "towards robust product packing with a minimalistic end effector"
    - "inferring 3d shapes of unknown rigid objects in clutter through inverse physics reasoning"
    - "sampling based methods for factored task and motion planning"
    - "automated motion planning for robotic assembly of discrete architectural structures"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "rearrangement with nonprehensile manipulation using deep reinforcement learning"
    - "efficient high quality stack rearrangement"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"

Connected through hyperedge HE-2 (induced by source paper "multi object rearrangement with monte carlo tree search a case study on planar nonprehensile sorting"):
  with members:
    - "learning to singulate objects using a push proposal network"
    - "learning manipulation states and actions for efficient non prehensile rearrangement planning"
    - "monte carlo tree search for efficient visually guided rearrangement planning"
    - "planning with a receding horizon for manipulation in clutter using a learned value function"
    - "real time online re planning for grasping under clutter and uncertainty"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "randomized physics based motion planning for grasping in cluttered and uncertain environments"
    - "high quality tabletop rearrangement with overhand grasps hardness results and fast methods"

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)