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: "denotational semantics for guarded dependent type theory"
  Abstract: We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs is encoded in types using guarded recursion, and can therefore be checked modularly, unlike the syntactic checks implemented in modern proof assistants. #R##N#The model is based on a category of covariant presheaves over a category of time objects, and quantification over clocks is modelled using a presheaf of clocks. To model the clock irrelevance axiom, crucial for programming with coinductive types, types must be interpreted as presheaves orthogonal to the object of clocks. In the case of dependent types, this translates to a unique lifting condition similar to the one found in homotopy theoretic models of type theory. Since the universes defined by the standard Hofmann-Streicher construction in this model do not satisfy this property, the universes in GDTT must be indexed by contexts of clock variables. A large and technical part of the paper is devoted to showing that these can be constructed in such a way that inclusions between universes induced by inclusions of clock variable contexts commute on the nose with type operations on the universes.

Connected through hyperedge HE-1 (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"
    - "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"
    - "fitch style modal lambda calculi"
    - "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-2 (induced by source paper "guarded computational type theory"):
  with members:
    - "guarded dependent type theory with coinductive types"
    - "guarded cubical type theory path equality for guarded recursion"
    - "monads need not be endofunctors"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-3 (induced by source paper "fitch style modal lambda calculi"):
  with members:
    - "internal universes in models of homotopy type theory"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "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"

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)