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: "canonicity for cubical type theory"
  Abstract: Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable. In this paper we prove canonicity for cubical type theory: any natural number in a context build from only name variables is judgmentally equal to a numeral. To achieve this we formulate a typed and deterministic operational semantics and employ a computability argument adapted to a presheaf-like setting.

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"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "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 "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"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-3 (induced by source paper "on higher inductive types in cubical type theory"):
  with members:
    - "computational higher type theory iv inductive types"
    - "internal universes in models of homotopy type theory"
    - "computational higher type theory iii univalent universes and exact equality"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "a mechanization of the blakers massey connectivity theorem in homotopy type theory"
    - "the equivalence of the torus and the product of two circles in homotopy type theory"

Connected through hyperedge HE-4 (induced by source paper "computational higher type theory iv inductive types"):
  with members:
    - "computational higher type theory iii univalent universes and exact equality"
    - "algebraic foundations of proof refinement"
    - "computational higher type theory i abstract cubical realizability"
    - "quotient inductive inductive types"
    - "computational higher type theory ii dependent cubical realizability"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-5 (induced by source paper "guarded cubical type theory"):
  with members:
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "axioms for modelling cubical type theory in a topos"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "guarded cubical type theory path equality for guarded recursion"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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)