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: "the automatic inference of state invariants in tim"
  Abstract: As planning is applied to larger and richer domains the effort involved in constructing domain descriptions increases and becomes a significant burden on the human application designer. If general planners are to be applied successfully to large and complex domains it is necessary to provide the domain designer with some assistance in building correctly encoded domains. One way of doing this is to provide domain-independent techniques for extracting, from a domain description, knowledge that is implicit in that description and that can assist domain designers in debugging domain descriptions. This knowledge can also be exploited to improve the performance of planners: several researchers have explored the potential of state invariants in speeding up the performance of domain-independent planners. In this paper we describe a process by which state invariants can be extracted from the automatically inferred type structure of a domain. These techniques are being developed for exploitation by STAN, a Graphplan based planner that employs state analysis techniques to enhance its performance.

Connected through hyperedge HE-1 (induced by source paper "guarantees for sound abstractions for generalized planning extended paper"):
  with members:
    - "generalized planning non deterministic abstractions and trajectory constraints"
    - "features projections and representation change for generalized planning"
    - "learning features and abstract actions for computing generalized plans"
    - "first order decision diagrams for relational mdps"

Connected through hyperedge HE-2 (induced by source paper "extracting lifted mutual exclusion invariants from temporal planning domains"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the fast downward planning system"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"

Connected through hyperedge HE-3 (induced by source paper "an empirical study of the effects of spurious transitions on abstraction based heuristics"):
  with members:
    - "the fast downward planning system"
    - "planning through stochastic local search and temporal action graphs in lpg"

Connected through hyperedge HE-4 (induced by source paper "analyzing search topology without running any search on the connection between causal graphs and h"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "planning over chain causal graphs for variables with domains of size 5 is np hard"
    - "the complexity of planning problems with simple causal graphs"
    - "the fast downward planning system"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "ordered landmarks in planning"
    - "structure and complexity in planning with unary operators"
    - "planning through stochastic local search and temporal action graphs in lpg"

Connected through hyperedge HE-5 (induced by source paper "on line planning and scheduling an application to controlling modular printers"):
  with members:
    - "regression with respect to sensing actions and partial states"
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-6 (induced by source paper "automatic induction of bellman error features for probabilistic planning"):
  with members:
    - "exploiting first order regression in inductive policy selection"
    - "inductive policy selection for first order mdps"
    - "practical linear value approximation techniques for first order mdps"
    - "flucap a heuristic search planner for first order mdps"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"
    - "learning first order definitions of functions"

Connected through hyperedge HE-7 (induced by source paper "divide and evolve a new memetic scheme for domain independent temporal planning"):
  with members:
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"

Connected through hyperedge HE-8 (induced by source paper "where ignoring delete lists works local search topology in planning benchmarks"):
  with members:
    - "engineering benchmarks for planning the domains used in the deterministic part of ipc 4"
    - "the deterministic part of ipc 4 an overview"
    - "taming numbers and durations in the model checking integrated planning system"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "the 3rd international planning competition results and analysis"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "the grt planning system backward heuristic construction in forward state space planning"

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)