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: "stack semantics of type theory"
  Abstract: We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalising the groupoid model of type theory. As an application, we show that countable choice cannot be proved in dependent type theory with one univalent universe and propositional truncation.

Connected through hyperedge HE-1 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming"):
  with members:
    - "an application of computable distributions to the semantics of probabilistic programs"
    - "formalising real numbers in homotopy type theory"
    - "a convenient category for higher order probability theory"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "the hott library a formalization of homotopy type theory in coq"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "quotient inductive inductive types"

Connected through hyperedge HE-2 (induced by source paper "cellular cohomology in homotopy type theory"):
  with members:
    - "computational higher type theory iv inductive types"
    - "on higher inductive types in cubical type theory"
    - "computational higher type theory iii univalent universes and exact equality"
    - "homotopy type theory in lean"
    - "the hott library a formalization of homotopy type theory in coq"
    - "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-3 (induced by source paper "partiality revisited the partiality monad as a quotient inductive inductive type"):
  with members:
    - "formalising real numbers in homotopy type theory"
    - "quotient inductive inductive types"
    - "higher inductive types as homotopy initial algebras"
    - "general recursion via coinductive types"

Connected through hyperedge HE-4 (induced by source paper "the independence of markov s principle in type theory"):
  with members:
    - "on irrelevance and algorithmic equality in predicative type theory"

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)