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: "on the compilability and expressive power of propositional planning formalisms"
  Abstract: The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of "compilation schemes" between planning formalisms. Using this notion, we analyze the expressiveness of a large family of propositional planning formalisms, ranging from basic STRIPS to a formalism with conditional effects, partial state specifications, and propositional formulae in the preconditions. One of the results is that conditional effects cannot be compiled away if plan size should grow only linearly but can be compiled away if we allow for polynomial growth of the resulting plans. This result confirms that the recently proposed extensions to the GRAPHPLAN algorithm concerning conditional effects are optimal with respect to the "compilability" framework. Another result is that general propositional formulae cannot be compiled into conditional effects if the plan size should be preserved linearly. This implies that allowing general propositional formulae in preconditions and effect conditions adds another level of difficulty in generating a plan.

Connected through hyperedge HE-1 (induced by source paper "efficient safe and probably approximately complete learning of action models"):
  with members:
    - "learning strips operators from noisy and incomplete observations"

Connected through hyperedge HE-2 (induced by source paper "negatively correlated search"):
  with members:
    - "genetic algorithms for evolving deep neural networks"

Connected through hyperedge HE-3 (induced by source paper "algorithms and limits for compact plan representations"):
  with members:
    - "on the size of data structures used in symbolic model checking"
    - "random access to grammar compressed strings"
    - "the complexity of planning problems with simple causal graphs"
    - "complexity issues in finding succinct solutions of pspace complete problems"
    - "on the complexity of case based planning"
    - "ordered landmarks in planning"
    - "structure and complexity in planning with unary operators"
    - "space efficiency of propositional knowledge representation formalisms"

Connected through hyperedge HE-4 (induced by source paper "engineering benchmarks for planning the domains used in the deterministic part of ipc 4"):
  with members:
    - "supply restoration in power distribution systems a case study in integrating model based diagnosis and repair planning"
    - "the fast downward planning system"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "the deterministic part of ipc 4 an overview"
    - "taming numbers and durations in the model checking integrated planning system"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"

Connected through hyperedge HE-5 (induced by source paper "complexity issues in finding succinct solutions of pspace complete problems"):
  with members:
    - "characterizations of the existence of partial and total one way permutations"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-6 (induced by source paper "the metric ff planning system translating ignoring delete lists to numeric state variables"):
  with members:
    - "taming numbers and durations in the model checking integrated planning system"
    - "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"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"

Connected through hyperedge HE-7 (induced by source paper "the ff planning system fast plan generation through heuristic search"):
  with members:
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
    - "efficient implementation of the plan graph in stan"
    - "the automatic inference of state invariants in tim"
    - "when gravity fails local search topology"

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)