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: "cubical type theory a constructive interpretation of the univalence axiom"
  Abstract: This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further, Voevodsky's univalence axiom is provable in this system. We also explain an extension with some higher inductive types like the circle and propositional truncation. Finally we provide semantics for this cubical type theory in a constructive meta-theory.

Connected through hyperedge HE-1 (induced by source paper "a cubical language for bishop sets"):
  with members:
    - "cubical syntax for reflection free extensional equality"
    - "pointers in recursion exploring the tropics"
    - "design and implementation of the andromeda proof assistant"
    - "the redprl proof assistant invited paper"
    - "computational higher type theory iii univalent universes and exact equality"
    - "canonicity for cubical type theory"
    - "programming with algebraic effects and handlers"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"

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

Connected through hyperedge HE-3 (induced by source paper "isabelle spartan a dependent type theory framework for isabelle"):
  with members:
    - "two level type theory and applications"

Connected through hyperedge HE-4 (induced by source paper "parametric cubical type theory"):
  with members:
    - "a general framework for relational parametricity"
    - "on higher inductive types in cubical type theory"
    - "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"
    - "abstract effects and proof relevant logical relations"
    - "a dependent nominal type theory"

Connected through hyperedge HE-5 (induced by source paper "cubical syntax for reflection free extensional equality"):
  with members:
    - "algebraic type theory and universe hierarchies"
    - "on higher inductive types in cubical type theory"
    - "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"
    - "canonicity for cubical type theory"

Connected through hyperedge HE-6 (induced by source paper "infinite types infinite data infinite interaction"):
  with members:
    - "bisimulation as path type for guarded recursive types"
    - "non wellfounded trees in homotopy type theory"
    - "a linear category of polynomial functors extensional part"
    - "a linear category of polynomial diagrams"
    - "relating coalgebraic notions of bisimulation"
    - "programming interfaces and basic topology"
    - "representations of stream processors using nested fixed points"

Connected through hyperedge HE-7 (induced by source paper "shallow embedding of type theory is morally correct"):
  with members:
    - "pointers in recursion exploring the tropics"
    - "canonicity and normalisation for dependent type theory"
    - "axioms for modelling cubical type theory in a topos"
    - "quotient inductive inductive types"
    - "normalisation by evaluation for type theory in type theory"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-8 (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"
    - "extending homotopy type theory with strict equality"
    - "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)