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: "on constructor rewrite systems and the lambda calculus"
  Abstract: We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by- value beta-reduction can be simulated by an orthogonal constructor term rewrite system in the same number of reduction steps. Conversely, each reduction in a term rewrite system can be simulated by a constant number of beta-reduction steps. This is relevant to implicit computational complexity, because the number of beta steps to normal form is polynomially related to the actual cost (that is, as performed on a Turing machine) of normalization, under weak call-by-value reduction. Orthogonal constructor term rewrite systems and lambda-calculus are thus both polynomially related to Turing machines, taking as notion of cost their natural parameters.

Connected through hyperedge HE-1 (induced by source paper "on probabilistic term rewriting"):
  with members:
    - "modular runtime complexity analysis of probabilistic while programs"
    - "bounded expectations resource analysis for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "on the hardness of almost sure termination"
    - "nagoya termination tool"
    - "church a language for generative models"
    - "efficient csl model checking using stratification"

Connected through hyperedge HE-2 (induced by source paper "combinatorics of explicit substitutions"):
  with members:
    - "counting environments and closures"
    - "normal order reduction grammars"
    - "combinatorics of lambda terms a natural approach"
    - "leftmost outermost beta reduction is invariant indeed"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "modular complexity analysis for term rewriting"
    - "counting and generating lambda terms"

Connected through hyperedge HE-3 (induced by source paper "on the enumeration of closures and environments with an application to random generation"):
  with members:
    - "combinatorics of explicit substitutions"
    - "normal order reduction grammars"
    - "leftmost outermost beta reduction is invariant indeed"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-4 (induced by source paper "implementing open call by value extended version"):
  with members:
    - "a strong distillery"
    - "on the relative usefulness of fireballs"

Connected through hyperedge HE-5 (induced by source paper "leftmost outermost beta reduction is invariant indeed"):
  with members:
    - "maximal sharing in the lambda calculus with letrec"
    - "execution time of lambda terms via denotational semantics and intersection types"

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"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"
    - "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 "on the relative usefulness of fireballs"):
  with members:
    - "maximal sharing in the lambda calculus with letrec"

Connected through hyperedge HE-8 (induced by source paper "on probabilistic applicative bisimulation and call by value λ calculi long version"):
  with members:
    - "probabilistic operational semantics for the lambda calculus"
    - "logical relations for monadic types"

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.PL(Programming Languages)