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: "compiling uncertainty away in conformant planning problems with bounded width"
  Abstract: Conformant planning is the problem of finding a sequence of actions for achieving a goal in the presence of uncertainty in the initial state or action effects. The problem has been approached as a path-finding problem in belief space where good belief representations and heuristics are critical for scaling up. In this work, a different formulation is introduced for conformant problems with deterministic actions where they are automatically converted into classical ones and solved by an off-the-shelf classical planner. The translation maps literals L and sets of assumptions t about the initial situation, into new literals KL/t that represent that L must be true if t is initially true. We lay out a general translation scheme that is sound and establish the conditions under which the translation is also complete. We show that the complexity of the complete translation is exponential in a parameter of the problem called the conformant width, which for most benchmarks is bounded. The planner based on this translation exhibits good performance in comparison with existing planners, and is the basis for T0, the best performing planner in the Conformant Track of the 2006 International Planning Competition.

Connected through hyperedge HE-1 (induced by source paper "memory bounded open loop planning in large pomdps using thompson sampling"):
  with members:
    - "leveraging statistical multi agent online planning with emergent value function approximation"
    - "open loop execution of tree search algorithms"
    - "stacked thompson bandits"
    - "further optimal regret bounds for thompson sampling"
    - "heuristic search value iteration for pomdps"
    - "online planning algorithms for pomdps"

Connected through hyperedge HE-2 (induced by source paper "generalized planning with procedural domain control knowledge"):
  with members:
    - "scaling up heuristic planning with relational decision trees"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "marvin a heuristic search planner with online macro action learning"
    - "the fast downward planning system"
    - "macro ff improving ai planning with automatically learned macro operators"

Connected through hyperedge HE-3 (induced by source paper "causal belief decomposition for planning with sensing completeness results and practical approximation"):
  with members:
    - "rao blackwellised particle filtering for dynamic bayesian networks"
    - "a knowledge compilation map"

Connected through hyperedge HE-4 (induced by source paper "model free model based and general intelligence"):
  with members:
    - "generalized planning non deterministic abstractions and trajectory constraints"
    - "feature based aggregation and deep reinforcement learning a survey and some new implementations"
    - "theoretical impediments to machine learning with seven sparks from the causal revolution"
    - "planning with pixels in almost real time"
    - "features projections and representation change for generalized planning"
    - "deep learning a critical appraisal"
    - "learning generalized reactive policies using deep neural networks"
    - "mastering chess and shogi by self play with a general reinforcement learning algorithm"

Connected through hyperedge HE-5 (induced by source paper "resolving distributed knowledge"):
  with members:
    - "cooperative epistemic multi agent planning for implicit coordination"
    - "a knowledge theoretic analysis of uniform distributed coordination and failure detectors"

Connected through hyperedge HE-6 (induced by source paper "a dynamic epistemic framework for conformant planning"):
  with members:
    - "planning graph heuristics for belief space search"
    - "conformant planning via symbolic model checking"

Connected through hyperedge HE-7 (induced by source paper "conformant planning as a case study of incremental qbf solving"):
  with members:
    - "incremental qbf solving"
    - "on qbf proofs and preprocessing"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-8 (induced by source paper "colin planning with continuous linear numeric change"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "a heuristic search approach to planning with continuous resources in stochastic domains"
    - "modelling mixed discrete continuous domains for planning"
    - "the fast downward planning system"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "the deterministic part of ipc 4 an overview"
    - "sapa a multi objective metric temporal planner"
    - "taming numbers and durations in the model checking integrated planning system"

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