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 "analyzing search topology without running any search on the connection between causal graphs and h"):
  Abstract: The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic h+ has amazing qualities in many classical planning benchmarks, in particular pertaining to the complete absence of local minima. The proofs of this are hand-made, raising the question whether such proofs can be lead automatically by domain analysis techniques. In contrast to earlier disappointing results - the analysis method has exponential runtime and succeeds only in two extremely simple benchmark domains - we herein answer this question in the afirmative. We establish connections between causal graph structure and h+ topology. This results in low-order polynomial time analysis methods, implemented in a tool we call TorchLight. Of the 12 domains where the absence of local minima has been proved, TorchLight gives strong success guarantees in 8 domains. Empirically, its analysis exhibits strong performance in a further 2 of these domains, plus in 4 more domains where local minima may exist but are rare. In this way, TorchLight can distinguish "easy" domains from "hard" ones. By summarizing structural reasons for analysis failure, TorchLight also provides diagnostic output indicating domain aspects that may cause local minima.

Includes members:
  Member "the lama planner guiding cost based anytime planning with landmarks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "planning over chain causal graphs for variables with domains of size 5 is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a refined view of causal graphs and component sizes sp closed graph classes and beyond")
  Member "the complexity of planning problems with simple causal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a complete parameterized complexity analysis of bounded planning")
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "where ignoring delete lists works local search topology in planning benchmarks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning to rank for synthesizing planning heuristics")
  Member "ordered landmarks in planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learn and link learning critical regions for efficient planning")
  Member "structure and complexity in planning with unary operators":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a complete parameterized complexity analysis of bounded planning")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "automated algorithm selection survey and perspectives")

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)