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 "hallucinative topological memory for zero shot visual planning"):
  Abstract: In visual planning (VP), an agent learns to plan goal-directed behavior from observations of a dynamical system obtained offline, e.g., images obtained from self-supervised robot interaction. Most previous works on VP approached the problem by planning in a learned latent space, resulting in low-quality visual plans, and difficult training algorithms. Here, instead, we propose a simple VP method that plans directly in image space and displays competitive performance. We build on the semi-parametric topological memory (SPTM) method: image samples are treated as nodes in a graph, the graph connectivity is learned from image sequence data, and planning can be performed using conventional graph search methods. We propose two modifications on SPTM. First, we train an energy-based graph connectivity function using contrastive predictive coding that admits stable training. Second, to allow zero-shot planning in new domains, we learn a conditional VAE model that generates images given a context of the domain, and use these hallucinated samples for building the connectivity graph and planning. We show that this simple approach significantly outperform the state-of-the-art VP methods, in terms of both plan interpretability and success rate when using the plan to guide a trajectory-following controller. Interestingly, our method can pick up non-trivial visual properties of objects, such as their geometry, and account for it in the plans.

Includes members:
  Member "unsupervised grounding of plannable first order logic representation from images":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "learning robotic manipulation through visual planning and acting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "search on the replay buffer bridging planning and reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "model based reinforcement learning for atari":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistic future prediction for video scene understanding")
  Member "hierarchical foresight self supervised learning of long horizon tasks via visual subgoal generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "goal conditioned end to end visuomotor control for versatile skill primitives")
  Member "robot motion planning in learned latent spaces":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probably approximately correct vision based planning using motion primitives")
  Member "universal planning networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")
  Member "learning latent dynamics for planning from pixels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "probabilistic future prediction for video scene understanding")

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)