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: "computational higher type theory iii univalent universes and exact equality"
  Abstract: This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types, exact equality and other pretypes lacking Kan structure, and a cumulative hierarchy of pretype universes. As in Parts I and II, the main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false. This establishes the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.

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"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "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 "parametric cubical type theory"):
  with members:
    - "a general framework for relational parametricity"
    - "on higher inductive types in cubical type theory"
    - "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 "cellular cohomology in homotopy type theory"):
  with members:
    - "computational higher type theory iv inductive types"
    - "on higher inductive types in cubical type theory"
    - "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-4 (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"
    - "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"
    - "canonicity for cubical type theory"
    - "the equivalence of the torus and the product of two circles in homotopy type theory"

Connected through hyperedge HE-5 (induced by source paper "computational higher type theory iv inductive types"):
  with members:
    - "algebraic foundations of proof refinement"
    - "computational higher type theory i abstract cubical realizability"
    - "quotient inductive inductive types"
    - "canonicity for cubical type theory"
    - "computational higher type theory ii dependent cubical realizability"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-6 (induced by source paper "free higher groups in homotopy type theory"):
  with members:
    - "higher groups in homotopy type theory"
    - "models of type theory with strict equality"
    - "quotient inductive inductive types"
    - "extending homotopy type theory with strict equality"
    - "functions out of higher truncations"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-7 (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"
    - "decomposing the univalence axiom"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical sets and the topological topos"
    - "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)