human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "denotational semantics for guarded dependent type theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "modal dependent type theory and dependent right adjoints")
  Member "internal universes in models of homotopy type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modal dependent type theory and dependent right adjoints")
  Member "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "dual context calculi for modal logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding the expressive power of unhygienic substitution in metaprogramming via combinatory logic")
  Member "the many worlds of modal λ calculi i curry howard for necessity possibility and time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "modality via iterated enrichment")
  Member "guarded dependent type theory with coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "constructive modalities with provability smack":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lewis meets brouwer constructive strict implication")
  Member "cut elimination and proof search for bi intuitionistic tense logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "annotation free sequent calculi for full intuitionistic linear logic extended version")

Question: Please tell me which class the source paper 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)