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: "planning with noisy probabilistic relational rules"
  Abstract: Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effectively from the action experiences in complex worlds. We investigate reasoning with such rules in grounded relational domains. Our algorithms exploit the compactness of rules for efficient and fexible decision-theoretic planning. As a first approach, we combine these rules with the Upper Confidence Bounds applied to Trees (UCT) algorithm based on look-ahead trees. Our second approach converts these rules into a structured dynamic Bayesian network representation and predicts the effects of action sequences using approximate inference and beliefs over world states. We evaluate the effectiveness of our approaches for planning in a simulated complex 3D robot manipulation scenario with an articulated manipulator and realistic physics and in domains of the probabilistic planning competition. Empirical results show that our methods can solve problems where existing methods fail.

Connected through hyperedge HE-1 (induced by source paper "pddlgym gym environments from pddl problems"):
  with members:
    - "glib exploration via goal literal babbling for lifted operator learning"
    - "glue a multi task benchmark and analysis platform for natural language understanding"
    - "moleculenet a benchmark for molecular machine learning"
    - "learning partially observable deterministic action models"
    - "learning symbolic models of stochastic domains"

Connected through hyperedge HE-2 (induced by source paper "symbol emergence in cognitive developmental systems a survey"):
  with members:
    - "interactive natural language acquisition in a multi modal recurrent neural architecture"
    - "interactively picking real world objects with unconstrained spoken language instructions"
    - "online spatial concept and lexical acquisition with simultaneous localization and mapping"
    - "serket an architecture for connecting stochastic models to realize a large scale cognitive model"
    - "detection of social signals for recognizing engagement in human robot interaction"
    - "grounded language learning in a simulated 3d world"
    - "grounding spatio semantic referring expressions for human robot interaction"
    - "discovering objects and their relations from entangled scene representations"

Connected through hyperedge HE-3 (induced by source paper "learning sparse relational transition models"):
  with members:
    - "learning symbolic models of stochastic domains"

Connected through hyperedge HE-4 (induced by source paper "high level reasoning and low level learning for grasping a probabilistic logic pipeline"):
  with members:
    - "deep learning for detecting robotic grasps"
    - "inference in probabilistic logic programs using weighted cnf s"
    - "cp logic a language of causal probabilistic events and its relation to logic programming"

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)