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 "algorithms and limits for compact plan representations"):
  Abstract: Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a plan) in this graph. While the graphs themselves are represented compactly as planning instances, the paths are usually represented explicitly as sequences of actions. Some cases are known where the plans always have compact representations, for example, using macros. We show that these results do not extend to the general case, by proving a number of bounds for compact representations of plans under various criteria, like efficient sequential or random access of actions. In addition to this, we show that our results have consequences for what can be gained from reformulating planning into some other problem. As a contrast to this we also prove a number of positive results, demonstrating restricted cases where plans do have useful compact representations, as well as proving that macro plans have favourable access properties. Our results are finally discussed in relation to other relevant contexts.

Includes members:
  Member "on the size of data structures used in symbolic model checking":
    also connected through other hyperedges:
      (none)
  Member "random access to grammar compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "local decode and update for big data compression")
  Member "the complexity of planning problems with simple causal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a complete parameterized complexity analysis of bounded planning")
  Member "complexity issues in finding succinct solutions of pspace complete problems":
    also connected through other hyperedges:
      (none)
  Member "on the complexity of case based planning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized complexity results for plan reuse")
  Member "ordered landmarks in planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "a complete parameterized complexity analysis of bounded planning")
  Member "on the compilability and expressive power of propositional planning formalisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)