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: "extending homotopy type theory with strict equality"
  Abstract: In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence.  This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types.  More generally, it is difficult and often impossible to handle towers of coherences.  To address this, we propose a 2-level theory which features both strict and weak equality.  This can essentially be represented as two type theories: an ``outer'' one, containing a strict equality type former, and an ``inner'' one, which is some version of HoTT.  Our type theory is inspired by Voevodsky's suggestion of a homotopy type system (HTS) which currently refers to a range of ideas.  A core insight of our proposal is that we do not need any form of equality reflection in order to achieve what HTS was suggested for.  Instead, having unique identity proofs in the outer type theory is sufficient, and it also has the meta-theoretical advantage of not breaking decidability of type checking.  The inner theory can be an easily justifiable extensions of HoTT, allowing the construction of ``infinite structures'' which are considered impossible in plain HoTT. Alternatively, we can set the inner theory to be exactly the current standard formulation of HoTT, in which case our system can be thought of as a type-theoretic framework for working with ``schematic'' definitions in HoTT.  As demonstrations, we define semi-simplicial types and formalise constructions of Reedy fibrant diagrams.

Connected through hyperedge HE-1 (induced by source paper "a role for dependent types in haskell extended version"):
  with members:
    - "generic zero cost reuse for dependent types"
    - "models of type theory with strict equality"
    - "dependent types in haskell theory and practice"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "on irrelevance and algorithmic equality in predicative type theory"

Connected through hyperedge HE-2 (induced by source paper "free higher groups in homotopy type theory"):
  with members:
    - "higher groups in homotopy type theory"
    - "models of type theory with strict equality"
    - "computational higher type theory iii univalent universes and exact equality"
    - "quotient inductive inductive types"
    - "functions out of higher truncations"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-3 (induced by source paper "internal universes in models of homotopy type theory"):
  with members:
    - "cubical assemblies and independence of the propositional resizing axiom"
    - "modal dependent type theory and dependent right adjoints"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "computational higher type theory iii univalent universes and exact equality"):
  with members:
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "computational higher type theory i abstract cubical realizability"
    - "computational higher type theory ii dependent cubical realizability"

Connected through hyperedge HE-5 (induced by source paper "two level type theory and applications"):
  with members:
    - "on higher inductive types in cubical type theory"
    - "internal universes in models of homotopy type theory"
    - "models of type theory with strict equality"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-6 (induced by source paper "models of type theory with strict equality"):
  with members:
    - "modules over relative monads for syntax and semantics"

Connected through hyperedge HE-7 (induced by source paper "quotient inductive inductive types"):
  with members:
    - "a mechanization of the blakers massey connectivity theorem in homotopy type theory"
    - "higher inductive types as homotopy initial algebras"

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)