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: "models of type theory with strict equality"
  Abstract: This thesis introduces the idea of two-level type theory, an extension of Martin-Lof type theory that adds a notion of strict equality as an internal primitive.#R##N##R##N#A type theory with a strict equality alongside the more conventional form of equality, the latter being of fundamental importance for the recent innovation of homotopy type theory (HoTT), was first proposed by Voevodsky, and is usually referred to as HTS.#R##N##R##N#Here, we generalise and expand this idea, by developing a semantic framework that gives a systematic account of type formers for two-level systems, and proving a conservativity result relating back to a conventional type theory like HoTT.#R##N##R##N#Finally, we show how a two-level theory can be used to provide partial solutions to open problems in HoTT. In particular, we use it to construct semi-simplicial types, and lay out the foundations of an internal theory of (∞, 1)-categories.

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"
    - "dependent types in haskell theory and practice"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "extending homotopy type theory with strict equality"
    - "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"
    - "computational higher type theory iii univalent universes and exact equality"
    - "quotient inductive inductive types"
    - "extending homotopy type theory with strict equality"
    - "functions out of higher truncations"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-3 (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"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "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)