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: "learning fast adaptation with meta strategy optimization"
  Abstract: The ability to walk in new scenarios is a key milestone on the path toward real-world applications of legged robots. In this work, we introduce Meta Strategy Optimization, a meta-learning algorithm for training policies with latent variable inputs that can quickly adapt to new scenarios with a handful of trials in the target environment. The key idea behind MSO is to expose the same adaptation process, Strategy Optimization (SO), to both the training and testing phases. This allows MSO to effectively learn locomotion skills as well as a latent space that is suitable for fast adaptation. We evaluate our method on a real quadruped robot and demonstrate successful adaptation in various scenarios, including sim-to-real transfer, walking with a weakened motor, or climbing up a slope. Furthermore, we quantitatively analyze the generalization capability of the trained policy in simulated environments. Both real and simulated experiments show that our method outperforms previous methods in adaptation to novel tasks.

Connected through hyperedge HE-1 (induced by source paper "rapidly adaptable legged robots via evolutionary meta learning"):
  with members:
    - "es maml simple hessian free meta learning"
    - "active domain randomization"
    - "efficient off policy meta reinforcement learning via probabilistic context variables"
    - "varibad a very good method for bayes adaptive deep rl via meta learning"
    - "multi agent manipulation via locomotion using hierarchical sim2real"
    - "norml no reward meta learning"
    - "learning generalizable locomotion skills with hierarchical reinforcement learning"
    - "learning agile and dynamic motor skills for legged robots"

Connected through hyperedge HE-2 (induced by source paper "learning to walk in the real world with minimal human effort"):
  with members:
    - "safety guided deep reinforcement learning via online gaussian process estimation"
    - "solving rubik s cube with a robot hand"
    - "generalizing from a few environments in safety critical reinforcement learning"
    - "data efficient reinforcement learning for legged robots"
    - "deepgait planning and control of quadrupedal gaits using deep reinforcement learning"
    - "norml no reward meta learning"
    - "tossingbot learning to throw arbitrary objects with residual physics"
    - "learning agile and dynamic motor skills for legged robots"

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)