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 "the metric ff planning system translating ignoring delete lists to numeric state variables"):
  Abstract: Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions.#R##N##R##N#We present a natural extension of "ignoring delete lists" to numeric state variables, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is "monotonic". We then identify a subset of the numeric IPC-3 competition language, "linear tasks", where monotonicity can be achieved by pre-processing. Based on that, we extend the algorithms used in the heuristic planning system FF to linear tasks. The resulting system Metric-FF is, according to the IPC-3 results which we discuss, one of the two currently most efficient numeric planners.

Includes members:
  Member "taming numbers and durations in the model checking integrated planning system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a hybrid lp rpg heuristic for modelling numeric resource flows in planning")
  Member "the 3rd international planning competition results and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automated algorithm selection survey and perspectives")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "the grt planning system backward heuristic construction in forward state space planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "where ignoring delete lists works local search topology in planning benchmarks")
  Member "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "planning based on classification by induction graph")
  Member "on the compilability and expressive power of propositional planning formalisms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient safe and probably approximately complete learning of action models")

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)