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 "a new order theoretic characterisation of the polytime computable functions"):
  Abstract: We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function gives rise to a rewrite system that is compatible with sPOP*. On the other hand any function defined by a rewrite system compatible with sPOP* is polynomial time computable. Technically sPOP* is a tamed recursive path order with product status. Its distinctive feature is the precise control provided. For any rewrite system that is compatible with sPOP* that makes use of recursion up to depth d, the (innermost) runtime complexity is bounded from above by a polynomial of degree d.

Includes members:
  Member "a combination framework for complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis")
  Member "polynomial path orders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "smarter features simpler learning")
  Member "on constructor rewrite systems and the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on probabilistic term rewriting")
  Member "polynomial path orders a maximal model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a combination framework for complexity")
  Member "automated complexity analysis based on the dependency pair method":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automated amortised resource analysis for term rewrite systems")
  Member "representations of stream processors using nested fixed points":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinite types infinite data infinite interaction")
  Member "proof theory at work complexity analysis of term rewrite systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a combination framework for complexity")
  Member "on tiered small jump operators":
    also connected through other hyperedges:
      (none)

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.CC(Computational Complexity)