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 montezuma s revenge from a single demonstration"
  Abstract: We propose a new method for learning from a single demonstration to solve hard exploration tasks like the Atari game Montezuma's Revenge. Instead of imitating human demonstrations, as proposed in other recent works, our approach is to maximize rewards directly. Our agent is trained using off-the-shelf reinforcement learning, but starts every episode by resetting to a state from a demonstration. By starting from such demonstration states, the agent requires much less exploration to learn a game compared to when it starts from the beginning of the game at every episode. We analyze reinforcement learning for tasks with sparse rewards in a simple toy environment, where we show that the run-time of standard RL methods scales exponentially in the number of states between rewards. Our method reduces this to quadratic scaling, opening up many tasks that were previously infeasible. We then apply our method to Montezuma's Revenge, for which we present a trained agent achieving a high-score of 74,500, better than any previously published result.

Connected through hyperedge HE-1 (induced by source paper "automatic curriculum learning for deep rl a short survey"):
  with members:
    - "language as a cognitive tool to imagine goals in curiosity driven exploration"
    - "solving rubik s cube with a robot hand"
    - "active domain randomization"
    - "emergent tool use from multi agent autocurricula"
    - "distilling policy distillation"
    - "language grounding through social interactions and curiosity driven multi goal learning"
    - "automated curricula through setter solver interactions"
    - "continual learning for robotics"

Connected through hyperedge HE-2 (induced by source paper "exploration based language learning for text based games"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "action assembly sparse imitation learning for text based games with combinatorial action spaces"
    - "transfer in deep reinforcement learning using knowledge graphs"
    - "a survey of reinforcement learning informed by natural language"
    - "exploration by random network distillation"
    - "using reinforcement learning to learn how to play text based games"
    - "textworld a learning environment for text based games"
    - "learn what not to learn action elimination with deep reinforcement learning"

Connected through hyperedge HE-3 (induced by source paper "deep reinforcement learning for complex manipulation tasks with sparse feedback"):
  with members:
    - "bias reduced hindsight experience replay with virtual goal prioritization"
    - "exploration by random network distillation"
    - "learning curriculum policies for reinforcement learning"
    - "multi goal reinforcement learning challenging robotics environments and request for research"
    - "energy based hindsight experience prioritization"
    - "hindsight experience replay"
    - "automatic goal generation for reinforcement learning agents"
    - "teacher student curriculum learning"

Connected through hyperedge HE-4 (induced by source paper "go explore a new approach for hard exploration problems"):
  with members:
    - "fractal ai a fragile theory of intelligence"
    - "exploration by random network distillation"
    - "backplay man muss immer umkehren"
    - "impala scalable distributed deep rl with importance weighted actor learner architectures"
    - "learning dexterous in hand manipulation"
    - "fast exploration with simplified models and approximately optimistic planning in model based reinforcement learning"
    - "deep curiosity search intra life exploration can improve performance on challenging deep reinforcement learning problems"
    - "playing hard exploration games by watching youtube"

Connected through hyperedge HE-5 (induced by source paper "towards finding longer proofs"):
  with members:
    - "enigma ng efficient neural and gradient boosted inference guidance for e"
    - "the minerl competition on sample efficient reinforcement learning using human priors"
    - "meta learning of sequential strategies"
    - "grunge a grand unified atp challenge"
    - "analysing mathematical reasoning abilities of neural models"
    - "graph representations for higher order logic and theorem proving"
    - "learning to speak and act in a fantasy text adventure game"
    - "hammering mizar by learning clause guidance"

Connected through hyperedge HE-6 (induced by source paper "self imitation learning via trajectory conditioned policy for hard exploration tasks"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "behaviour suite for reinforcement learning"
    - "skew fit state covering self supervised reinforcement learning"
    - "making efficient use of demonstrations to solve hard exploration problems"
    - "generative adversarial self imitation learning"
    - "exploration by random network distillation"
    - "deep curiosity search intra life exploration can improve performance on challenging deep reinforcement learning problems"
    - "playing hard exploration games by watching youtube"

Connected through hyperedge HE-7 (induced by source paper "toybox a suite of environments for experimental evaluation of deep reinforcement learning"):
  with members:
    - "let s play again variability of deep reinforcement learning agents in atari environments"
    - "modularization of end to end learning case study in arcade games"
    - "paired open ended trailblazer poet endlessly generating increasingly complex and diverse learning environments and their solutions"
    - "exploration by random network distillation"
    - "strategic object oriented reinforcement learning"
    - "natural environment benchmarks for reinforcement learning"
    - "investigating human priors for playing video games"
    - "quantifying generalization in reinforcement learning"

Connected through hyperedge HE-8 (induced by source paper "making efficient use of demonstrations to solve hard exploration problems"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "reinforced imitation in heterogeneous action space"
    - "benchmarking model based reinforcement learning"
    - "benchmarking bonus based exploration methods on the arcade learning environment"
    - "obstacle tower a generalization challenge in vision control and planning"
    - "off policy deep reinforcement learning without exploration"
    - "deepmimic example guided deep reinforcement learning of physics based character skills"
    - "playing hard exploration games by watching youtube"

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.LG(Machine Learning)