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: "programming and reasoning with guarded recursion for coinductive types"
  Abstract: We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions. We give a call-by-name operational semantics for the calculus, and define adequate denotational semantics in the topos of trees. The adequacy proof entails that the evaluation of a program always terminates. We demonstrate the expressiveness of the calculus by showing the definability of solutions to Rutten's behavioural differential equations. We introduce a program logic with L\"{o}b induction for reasoning about the contextual equivalence of programs.

Connected through hyperedge HE-1 (induced by source paper "the size change principle for mixed inductive and coinductive types"):
  with members:
    - "a generalized modality for recursion"
    - "the size change termination principle for constructor based languages"
    - "type based termination inflationary fixed points and mixed inductive coinductive types"
    - "miniagda integrating sized and dependent types"

Connected through hyperedge HE-2 (induced by source paper "lewis meets brouwer constructive strict implication"):
  with members:
    - "a light modality for recursion"
    - "guard your daggers and traces properties of guarded co recursion"
    - "guarded dependent type theory with coinductive types"
    - "sequent calculus in the topos of trees"
    - "constructive modalities with provability smack"
    - "epistemic updates on algebras"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "canonized rewriting and ground ac completion modulo shostak theories design and implementation"

Connected through hyperedge HE-3 (induced by source paper "modal dependent type theory and dependent right adjoints"):
  with members:
    - "the clocks they are adjunctions denotational semantics for clocked type theory"
    - "denotational semantics for guarded dependent type theory"
    - "internal universes in models of homotopy type theory"
    - "dual context calculi for modal logic"
    - "undecidability of equality in the free locally cartesian closed category extended version"
    - "fitch style modal lambda calculi"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-4 (induced by source paper "a light modality for recursion"):
  with members:
    - "guarded dependent type theory with coinductive types"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "continuous markovian logics axiomatization and quantified metatheory"

Connected through hyperedge HE-5 (induced by source paper "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "constructive modalities with provability smack"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-6 (induced by source paper "on sessions and infinite data"):
  with members:
    - "a light modality for recursion"

Connected through hyperedge HE-7 (induced by source paper "guarded cubical type theory"):
  with members:
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "axioms for modelling cubical type theory in a topos"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"
    - "guarded cubical type theory path equality for guarded recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-8 (induced by source paper "guarded cubical type theory path equality for guarded recursion"):
  with members:
    - "axioms for modelling cubical type theory in a topos"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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)