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: "adaptive prior selection for repertoire based online adaptation in robotics"
  Abstract: Repertoire-based learning is a data-efficient adaptation approach based on a two-step process in which (1) a large and diverse set of policies is learned in simulation, and (2) a planning or learning algorithm chooses the most appropriate policies according to the current situation (e.g., a damaged robot, a new object, etc.). In this paper, we relax the assumption of previous works that a single repertoire is enough for adaptation. Instead, we generate repertoires for many different situations (e.g., with a missing leg, on different floors, etc.) and let our algorithm selects the most useful prior. Our main contribution is an algorithm, APROL (Adaptive Prior selection for Repertoire-based Online Learning) to plan the next action by incorporating these priors when the robot has no information about the current situation. We evaluate APROL on two simulated tasks: (1) pushing unknown objects of various shapes and sizes with a robotic arm and (2) a goal reaching task with a damaged hexapod robot. We compare with "Reset-free Trial and Error" (RTE) and various single repertoire-based base-lines. The results show that APROL solves both the tasks in less interaction time than the baselines. Additionally , we demonstrate APROL on a real, damaged hexapod that quickly learns to pick compensatory policies to reach a goal by avoiding obstacles in the path.

Connected through hyperedge HE-1 (induced by source paper "fast online adaptation in robotics through meta learning embeddings of simulated priors"):
  with members:
    - "reset free trial and error learning for robot damage recovery"
    - "on first order meta learning algorithms"
    - "multi objective model based policy search for data efficient learning with sparse rewards"
    - "efficient transfer learning and online adaptation with latent variable models for continuous control"
    - "deep reinforcement learning in a handful of trials using probabilistic dynamics models"
    - "a survey on policy search algorithms for learning robot controllers in a handful of trials"
    - "bayesian optimization with automatic prior selection for data efficient direct policy search"
    - "neural network dynamics for model based deep reinforcement learning with model free fine tuning"

Connected through hyperedge HE-2 (induced by source paper "quality diversity for multi task optimization"):
  with members:
    - "procedural content generation through quality diversity"
    - "reset free trial and error learning for robot damage recovery"
    - "discovering the elite hypervolume by leveraging interspecies correlation"
    - "bayesian optimization with automatic prior selection for data efficient direct policy search"
    - "evolutionary multitasking for single objective continuous optimization benchmark problems performance metric and baseline results"
    - "data efficient exploration optimization and modeling of diverse designs through surrogate assisted illumination"
    - "quality and diversity optimization a unifying modular framework"
    - "robots that can adapt like animals"

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)