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: "a combination framework for complexity"
  Abstract: In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis. We present generalisations of powerful complexity techniques, notably a generalisation of complexity pairs and (weak) dependency pairs. Finally, we also present a novel technique, called dependency graph decomposition, that in the dependency pair setting greatly increases modularity. We employ the framework in the automated complexity tool TCT. TCT implements a majority of the techniques found in the literature, witnessing that our framework is general enough to capture a very brought setting.

Connected through hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis"):
  with members:
    - "analysis of logarithmic amortised complexity"
    - "verifying and synthesizing constant resource implementations with types"
    - "bounded expectations resource analysis for probabilistic programs"
    - "work analysis with resource aware session types"
    - "non polynomial worst case analysis of recursive programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"

Connected through hyperedge HE-2 (induced by source paper "verifying and synthesizing constant resource implementations with types"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "linear dependent types and relative completeness"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-3 (induced by source paper "bounded expectations resource analysis for probabilistic programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "how long o bayesian network will i sample thee a program analysis perspective on expected sampling times"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "non polynomial worst case analysis of recursive programs"
    - "a program logic for union bounds"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"

Connected through hyperedge HE-4 (induced by source paper "towards automatic resource bound analysis for ocaml"):
  with members:
    - "denotational cost semantics for functional languages with inductive types"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "linear dependent types and relative completeness"
    - "a static cost analysis for a higher order language"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-5 (induced by source paper "kruskal s tree theorem for acyclic term graphs"):
  with members:
    - "proving termination of graph transformation systems using weighted type graphs over semirings"
    - "non simplifying graph rewriting termination"

Connected through hyperedge HE-6 (induced by source paper "analysing the complexity of functional programs higher order meets first order long version"):
  with members:
    - "modular complexity analysis for term rewriting"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "linear dependent types and relative completeness"
    - "on constructor rewrite systems and the lambda calculus"
    - "automated complexity analysis based on the dependency pair method"
    - "call by value termination in the untyped lambda calculus"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "polynomial path orders"):
  with members:
    - "on constructor rewrite systems and the lambda calculus"
    - "a new order theoretic characterisation of the polytime computable functions"
    - "automated complexity analysis based on the dependency pair method"
    - "general ramified recurrence is sound for polynomial time"
    - "dependency pairs and polynomial path orders"
    - "satisfying kbo constraints"

Connected through hyperedge HE-8 (induced by source paper "a new order theoretic characterisation of the polytime computable functions"):
  with members:
    - "polynomial path orders"
    - "on constructor rewrite systems and the lambda calculus"
    - "polynomial path orders a maximal model"
    - "automated complexity analysis based on the dependency pair method"
    - "representations of stream processors using nested fixed points"
    - "proof theory at work complexity analysis of term rewrite systems"
    - "on tiered small jump operators"
    - "a new function algebra of exptime functions by safe nested recursion"

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