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: "guarded cubical type theory path equality for guarded recursion"
  Abstract: This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types. We wish to implement GDTT with decidable type-checking, while still supporting non-trivial equality proofs that reason about the extensions of guarded recursive constructions. CTT is a variation of Martin-L\"of type theory in which the identity type is replaced by abstract paths between terms. CTT provides a computational interpretation of functional extensionality, is conjectured to have decidable type checking, and has an implemented type-checker. Our new type theory, called guarded cubical type theory, provides a computational interpretation of extensionality for guarded recursive types. This further expands the foundations of CTT as a basis for formalisation in mathematics and computer science. We present examples to demonstrate the expressivity of our type theory, all of which have been checked using a prototype type-checker implementation, and present semantics in a presheaf category.

Connected through hyperedge HE-1 (induced by source paper "denotational semantics of recursive types in synthetic guarded domain theory"):
  with members:
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "quotient inductive inductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "general recursion via coinductive types"

Connected through hyperedge HE-2 (induced by source paper "a generalized modality for recursion"):
  with members:
    - "a light modality for recursion"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "guarded dependent type theory with coinductive types"
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-3 (induced by source paper "guarded computational type theory"):
  with members:
    - "denotational semantics for guarded dependent type theory"
    - "guarded dependent type theory with coinductive types"
    - "monads need not be endofunctors"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "axioms for modelling cubical type theory in a topos"):
  with members:
    - "internal universes in models of homotopy type theory"
    - "a homotopy theoretic model of function extensionality in the effective topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-5 (induced by source paper "guarded cubical type theory"):
  with members:
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "axioms for modelling cubical type theory in a topos"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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)