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 "qmdp net deep learning for planning under partial observability"):
  Abstract: This paper introduces the QMDP-net, a neural network architecture for planning under partial observability. The QMDP-net combines the strengths of model-free learning and model-based planning. It is a recurrent policy network, but it represents a policy for a parameterized set of tasks by connecting a model with a planning algorithm that solves the model, thus embedding the solution structure of planning in a network learning architecture. The QMDP-net is fully differentiable and allows for end-to-end training. We train a QMDP-net on different tasks so that it can generalize to new ones in the parameterized task set and "transfer" to other similar tasks beyond the set. In preliminary experiments, QMDP-net showed strong performance on several robotic tasks in simulation. Interestingly, while QMDP-net encodes the QMDP algorithm, it sometimes outperforms the QMDP algorithm in the experiments, as a result of end-to-end learning.

Includes members:
  Member "path integral networks end to end differentiable optimal control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "planet of the bayesians reconsidering and improving deep planning network by incorporating bayesian inference")
  Member "reinforcement learning via recurrent convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning navigation costs from demonstration in partially observable environments")
  Member "despot online pomdp planning with regularization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient uncertainty aware decision making for automated driving using guided branching")
  Member "cognitive mapping and planning for visual navigation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mvp unified motion and visual self supervised learning for large scale robotic navigation")
  Member "value iteration networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "backprop kf learning discriminative deterministic state estimators":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "disentangling physical dynamics from unknown factors for unsupervised video prediction")
  Member "learning to navigate in complex environments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "perception and decision making of autonomous systems in the era of learning an overview")
  Member "convolutional lstm network a machine learning approach for precipitation nowcasting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "transformation based adversarial video prediction on large scale data")

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)