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 "memory bounded open loop planning in large pomdps using thompson sampling"):
  Abstract: State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search. While these approaches are computationally efficient, they may still construct search trees of considerable size, which could limit the performance due to restricted memory resources. In this paper, we propose Partially Observable Stacked Thompson Sampling (POSTS), a memory bounded approach to open-loop planning in large POMDPs, which optimizes a fixed size stack of Thompson Sampling bandits. We empirically evaluate POSTS in four large benchmark problems and compare its performance with different tree-based approaches. We show that POSTS achieves competitive performance compared to tree-based open-loop planning and offers a performance-memory tradeoff, making it suitable for partially observable planning with highly restricted computational and memory resources.

Includes members:
  Member "leveraging statistical multi agent online planning with emergent value function approximation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed policy iteration for scalable approximation of cooperative multi agent policies")
  Member "open loop execution of tree search algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed policy iteration for scalable approximation of cooperative multi agent policies")
  Member "stacked thompson bandits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive thompson sampling stacks for memory bounded open loop planning")
  Member "further optimal regret bounds for thompson sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "delay adaptive learning in generalized linear contextual bandits")
  Member "heuristic search value iteration for pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "compiling uncertainty away in conformant planning problems with bounded width":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized planning with procedural domain control knowledge")
  Member "online planning algorithms for pomdps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reinforcement learning for pomdp partitioned rollout and policy iteration with application to autonomous sequential repair problems")

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)