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

Connected through hyperedge HE-1 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion"):
  with members:
    - "simply ratt a fitch style modal calculus for reactive programming without space leaks"
    - "denotational semantics of recursive types in synthetic guarded domain theory"
    - "a generalized modality for recursion"
    - "modal dependent type theory and dependent right adjoints"
    - "fitch style modal lambda calculi"
    - "guarded cubical type theory"
    - "guarded dependent type theory with coinductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-2 (induced by source paper "relational reasoning for markov chains in a probabilistic guarded lambda calculus"):
  with members:
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "guarded dependent type theory with coinductive types"
    - "differentially private bayesian programming"
    - "relational reasoning via probabilistic coupling"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-3 (induced by source paper "a metalanguage for guarded iteration"):
  with members:
    - "guarded traced categories"
    - "a semantics for hybrid iteration"
    - "guard your daggers and traces properties of guarded co recursion"
    - "complete elgot monads and coalgebraic resumptions"
    - "a decidable weakening of compass logic based on cone shaped cardinal directions"
    - "a hoare logic for the coinductive trace based big step semantics of while"
    - "intensionality definability and computation"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "a generalized modality for recursion"):
  with members:
    - "a light modality for recursion"
    - "guarded dependent type theory with coinductive types"
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "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-5 (induced by source paper "modalities cohesion and information flow"):
  with members:
    - "types for information flow control labeling granularity and semantic models"
    - "dual context calculi for modal logic"
    - "proving noninterference by a fully complete translation to the simply typed lambda calculus"

Connected through hyperedge HE-6 (induced by source paper "fitch style modal lambda calculi"):
  with members:
    - "denotational semantics for guarded dependent type theory"
    - "internal universes in models of homotopy type theory"
    - "dual context calculi for modal logic"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"
    - "guarded dependent type theory with coinductive types"
    - "constructive modalities with provability smack"
    - "cut elimination and proof search for bi intuitionistic tense logic"

Connected through hyperedge HE-7 (induced by source paper "guarded cubical type theory"):
  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"
    - "canonicity for cubical type theory"
    - "guarded cubical type theory path equality for guarded recursion"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-8 (induced by source paper "system k a simple modal lambda calculus"):
  with members:
    - "dual context calculi for modal logic"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"
    - "calculi for intuitionistic normal modal logic"

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.LO(Logic in Computer Science)