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: "the hott library a formalization of homotopy type theory in coq"
  Abstract: We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of synthetic homotopy theory, as well as category theory and modalities. The library has been used as a basis for several independent developments. We discuss the decisions that led to the design of the library, and we comment on the interaction of homotopy type theory with recently introduced features of Coq, such as universe polymorphism and private inductive types.

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"
    - "stack semantics of type theory"
    - "a convenient category for higher order probability theory"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "quotient inductive inductive types"

Connected through hyperedge HE-2 (induced by source paper "a hott quantum equational theory extended version"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "homotopies for free"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "higher inductive types as homotopy initial algebras"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-3 (induced by source paper "cubical assemblies a univalent and impredicative universe and a failure of propositional resizing"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "modal dependent type theory and dependent right adjoints"
    - "axioms for modelling cubical type theory in a topos"

Connected through hyperedge HE-4 (induced by source paper "the marriage of univalence and parametricity"):
  with members:
    - "revisiting parametricity inductives and uniformity of propositions"
    - "automatic and transparent transfer of theorems along isomorphisms in the coq proof assistant"

Connected through hyperedge HE-5 (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"
    - "stack semantics of type theory"
    - "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-6 (induced by source paper "cubical assemblies and independence of the propositional resizing axiom"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "internal universes in models of homotopy type theory"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-7 (induced by source paper "the redprl proof assistant invited paper"):
  with members:
    - "homotopy type theory in lean"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-8 (induced by source paper "homotopy type theory in lean"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"

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)