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: "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.

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"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "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 "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"
    - "fitch style modal lambda calculi"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-3 (induced by source paper "cubical assemblies a univalent and impredicative universe and a failure of propositional resizing"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "axioms for modelling cubical type theory in a topos"
    - "the hott library a formalization of homotopy type theory in coq"

Connected through hyperedge HE-4 (induced by source paper "internal universes in models of homotopy type theory"):
  with members:
    - "cubical assemblies and independence of the propositional resizing axiom"
    - "computational higher type theory iii univalent universes and exact equality"
    - "decomposing the univalence axiom"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical sets and the topological topos"
    - "extending homotopy type theory with strict equality"

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)