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: "denotational cost semantics for functional languages with inductive types"
  Abstract: A central method for analyzing the asymptotic complexity of a functional program is to extract and then solve a recurrence that expresses evaluation cost in terms of input size. The relevant notion of input size is often specific to a datatype, with measures including the length of a list, the maximum element in a list, and the height of a tree. In this work, we give a formal account of the extraction of cost and size recurrences from higher-order functional programs over inductive datatypes. Our approach allows a wide range of programmer-specified notions of size, and ensures that the extracted recurrences correctly predict evaluation cost. To extract a recurrence from a program, we first make costs explicit by applying a monadic translation from the source language to a complexity language, and then abstract datatype values as sizes. Size abstraction can be done semantically, working in models of the complexity language, or syntactically, by adding rules to a preorder judgement. We give several different models of the complexity language, which support different notions of size. Additionally, we prove by a logical relations argument that recurrences extracted by this process are upper bounds for evaluation cost; the proof is entirely syntactic and therefore applies to all of the models we consider.

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"
    - "a combination framework for complexity"

Connected through hyperedge HE-2 (induced by source paper "denotational semantics as a foundation for cost recurrence extraction for functional languages"):
  with members:
    - "recurrence extraction for functional programs through call by push value"
    - "towards automatic resource bound analysis for ocaml"
    - "a static cost analysis for a higher order language"
    - "improvements for free"
    - "adventures in time and space"

Connected through hyperedge HE-3 (induced by source paper "recurrence extraction for functional programs through call by push value"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "a static cost analysis for a higher order language"
    - "adventures in time and space"

Connected through hyperedge HE-4 (induced by source paper "resource guided program synthesis"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "towards automatic resource bound analysis for ocaml"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "synthesis of recursive adt transformations from reusable templates"
    - "program synthesis from polymorphic refinement types"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"

Connected through hyperedge HE-5 (induced by source paper "a unifying framework for continuity and complexity in higher types"):
  with members:
    - "a static cost analysis for a higher order language"

Connected through hyperedge HE-6 (induced by source paper "parallel complexity analysis with temporal session types"):
  with members:
    - "work analysis with resource aware session types"
    - "non blocking concurrent imperative programming with session types"
    - "the complexity of interaction"
    - "towards automatic resource bound analysis for ocaml"
    - "timed runtime monitoring for multiparty conversations"
    - "linear dependent types and relative completeness"

Connected through hyperedge HE-7 (induced by source paper "verifying and synthesizing constant resource implementations with types"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-8 (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"

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)