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: "axioms for modelling cubical type theory in a topos"
  Abstract: The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$. Cohen, Coquand, Huber and M\"ortberg give such a model using a particular category of presheaves. We investigate the extent to which their model construction can be expressed in the internal type theory of any topos and identify a collection of quite weak axioms for this purpose. This clarifies the definition and properties of the notion of uniform Kan filling that lies at the heart of their constructive interpretation of Voevodsky's univalence axiom. (This paper is a revised and expanded version of a paper of the same name that appeared in the proceedings of the 25th EACSL Annual Conference on Computer Science Logic, CSL 2016.)

Connected through hyperedge HE-1 (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"
    - "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-2 (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"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "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-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"
    - "the hott library a formalization of homotopy type theory in coq"

Connected through hyperedge HE-4 (induced by source paper "from cubes to twisted cubes via graph morphisms in type theory"):
  with members:
    - "towards a directed homotopy type theory"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-5 (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"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "a mechanization of the blakers massey connectivity theorem in homotopy type theory"
    - "canonicity for cubical type theory"
    - "the equivalence of the torus and the product of two circles in homotopy type theory"

Connected through hyperedge HE-6 (induced by source paper "internal universes in models of homotopy type theory"):
  with members:
    - "cubical assemblies and independence of the propositional resizing axiom"
    - "modal dependent type theory and dependent right adjoints"
    - "computational higher type theory iii univalent universes and exact equality"
    - "decomposing the univalence axiom"
    - "cubical sets and the topological topos"
    - "extending homotopy type theory with strict equality"

Connected through hyperedge HE-7 (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"
    - "the hott library a formalization of homotopy type theory in coq"
    - "cubical type theory a constructive interpretation of the univalence axiom"

Connected through hyperedge HE-8 (induced by source paper "models of type theory based on moore paths"):
  with members:
    - "internal universes in models of homotopy type theory"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "cubical sets and the topological topos"

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)