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: "on higher inductive types in cubical type theory"
  Abstract: Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly provable in the theory. This paper describes a constructive semantics, expressed in a presheaf topos with suitable structure inspired by cubical sets, of some higher inductive types. It also extends cubical type theory by a syntax for the higher inductive types of spheres, torus, suspensions,truncations, and pushouts. All of these types are justified by the semantics and have judgmental computation rules for all constructors, including the higher dimensional ones, and the universes are closed under these type formers.

Connected through hyperedge HE-1 (induced by source paper "constructing higher inductive types as groupoid quotients"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "normalisation by evaluation for type theory in type theory"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-2 (induced by source paper "parametric cubical type theory"):
  with members:
    - "a general framework for relational parametricity"
    - "computational higher type theory iii univalent universes and exact equality"
    - "parametricity automorphisms of the universe and excluded middle"
    - "cubical categories for higher dimensional parametricity"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "abstract effects and proof relevant logical relations"
    - "a dependent nominal type theory"

Connected through hyperedge HE-3 (induced by source paper "cubical syntax for reflection free extensional equality"):
  with members:
    - "algebraic type theory and universe hierarchies"
    - "canonicity and normalisation for dependent type theory"
    - "design and implementation of the andromeda proof assistant"
    - "the redprl proof assistant invited paper"
    - "undecidability of equality in the free locally cartesian closed category extended version"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"

Connected through hyperedge HE-4 (induced by source paper "signatures and induction principles for higher inductive inductive types"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "quotient inductive inductive types"
    - "type theory based on dependent inductive and coinductive types"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-5 (induced by source paper "naive cubical type theory"):
  with members:
    - "computational higher type theory iv inductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-6 (induced by source paper "cellular cohomology in homotopy type theory"):
  with members:
    - "computational higher type theory iv inductive types"
    - "computational higher type theory iii univalent universes and exact equality"
    - "homotopy type theory in lean"
    - "stack semantics of type theory"
    - "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-7 (induced by source paper "code generation for higher inductive types"):
  with members:
    - "computational higher type theory iv inductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "a categorical theory of patches"
    - "forty hours of declarative programming teaching prolog at the junior college utrecht"

Connected through hyperedge HE-8 (induced by source paper "two level type theory and applications"):
  with members:
    - "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"
    - "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)