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 "region growing curriculum generation for reinforcement learning"):
  Abstract: Learning a policy capable of moving an agent between any two states in the environment is important for many robotics problems involving navigation and manipulation. Due to the sparsity of rewards in such tasks, applying reinforcement learning in these scenarios can be challenging. Common approaches for tackling this problem include reward engineering with auxiliary rewards, requiring domain-specific knowledge or changing the objective. #R##N#In this work, we introduce a method based on region-growing that allows learning in an environment with any pair of initial and goal states. Our algorithm first learns how to move between nearby states and then increases the difficulty of the start-goal transitions as the agent's performance improves. This approach creates an efficient curriculum for learning the objective behavior of reaching any goal from any initial state. In addition, we describe a method to adaptively adjust expansion of the growing region that allows automatic adjustment of the key exploration hyperparameter to environments with different requirements. We evaluate our approach on a set of simulated navigation and manipulation tasks, where we demonstrate that our algorithm can efficiently learn a policy in the presence of sparse rewards.

Includes members:
  Member "began boundary equilibrium generative adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "automatic goal generation for reinforcement learning agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meta learning curiosity algorithms")
  Member "teacher student curriculum learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automatic curriculum learning for deep rl a short survey")
  Member "learning to multi task by active sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "revisiting meta learning as supervised learning")
  Member "reverse curriculum generation for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "curriculum learning for reinforcement learning domains a framework and survey")
  Member "intrinsic motivation and automatic curricula via asymmetric self play":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "combining model based and model free updates for trajectory centric reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multimodal trajectory optimization for motion planning")
  Member "count based exploration with neural density models":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")

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.AI(Artificial Intelligence)