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: "fitch style modal lambda calculi"
  Abstract: Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational properties for a variety of intuitionistic modal logics. Semantics are given in cartesian closed categories equipped with an adjunction of endofunctors, with the necessity modality interpreted by the right adjoint. Where this functor is an idempotent comonad, a coherence result on the semantics allows us to present a calculus for intuitionistic S4 that is simpler than others in the literature. We show the calculi can be extended a la tense logic with the left adjoint of necessity, and are then complete for the categorical semantics.

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"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "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 "simply ratt a fitch style modal calculus for reactive programming without space leaks"):
  with members:
    - "the clocks they are adjunctions denotational semantics for clocked type theory"
    - "a generalized modality for recursion"
    - "modal dependent type theory and dependent right adjoints"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "programming and reasoning with guarded recursion for coinductive types"

Connected through hyperedge HE-4 (induced by source paper "modality via iterated enrichment"):
  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"

Connected through hyperedge HE-5 (induced by source paper "polymorphic context for contextual modality"):
  with members:
    - "dual context calculi for 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)