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 "modal dependent type theory and dependent right adjoints"):
  Abstract: In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory, and spatial and cohesive type theory. In this paper we study modal dependent type theory: dependent type theory with an operator satisfying (a dependent version of) the K-axiom of modal logic. We investigate both semantics and syntax. For the semantics, we introduce categories with families with a dependent right adjoint (CwDRA) and show that the examples above can be presented as such. Indeed, we show that any finite limit category with an adjunction of endofunctors gives rise to a CwDRA via the local universe construction. For the syntax, we introduce a dependently typed extension of Fitch-style modal lambda-calculus, show that it can be interpreted in any CwDRA, and build a term model. We extend the syntax and semantics with universes.

Includes members:
  Member "the clocks they are adjunctions denotational semantics for clocked type theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simply ratt a fitch style modal calculus for reactive programming without space leaks")
  Member "denotational semantics for guarded dependent type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "guarded computational type theory")
  Member "internal universes in models of homotopy type theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on higher inductive types in cubical type theory")
  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 "undecidability of equality in the free locally cartesian closed category extended version":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cubical syntax for reflection free extensional equality")
  Member "fitch style modal lambda calculi":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "guarded dependent type theory with coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a cubical language for bishop sets")

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)