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 static cost analysis for a higher order language"
  Abstract: We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the expression's evaluation derivation in a standard big-step operational semantics. The latter is a measure of the "future" cost of using the value of that expression. A translation function tr maps target expressions to complexities. Our main result is the following Soundness Theorem: If t is a term in the target language, then the cost component of tr(t) is an upper bound on the cost of evaluating t. The proof of the Soundness Theorem is formalized in Coq, providing certified upper bounds on the cost of any expression in the target language.

Connected through hyperedge HE-1 (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"
    - "denotational cost semantics for functional languages with inductive types"
    - "improvements for free"
    - "adventures in time and space"

Connected through hyperedge HE-2 (induced by source paper "recurrence extraction for functional programs through call by push value"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "adventures in time and space"

Connected through hyperedge HE-3 (induced by source paper "a unifying framework for continuity and complexity in higher types"):
  with members:
    - "denotational cost semantics for functional languages with inductive types"

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"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-5 (induced by source paper "denotational cost semantics for functional languages with inductive types"):
  with members:
    - "coinductive big step operational semantics"
    - "two algorithms in search of a type system"

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)