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 iv inductive types"
  Abstract: This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of cubical inductive types, inductive types whose constructors may take dimension parameters and may have specified boundaries. Using this schema, we are able to specify and implement many of the higher inductive types which have been postulated in homotopy type theory, including homotopy pushouts, the torus, $W$-quotients, truncations, and arbitrary localizations. We also construct one indexed inductive type, the fiber family of a term. Using the fiber family, it is possible to define an identity type whose eliminator satisfies an exact computation rule on the reflexivity constructor. We believe that the techniques used to construct the fiber family could be straightforwardly combined with our schema for inductive types in order to give a schema for indexed cubical inductive types. The addition of higher inductive types and identity types makes computational higher type theory a model of homotopy type theory, capable of interpreting almost all of the constructions in the HoTT Book (with the exception of general indexed inductive types and inductive-inductive types). This is the first such model with an explicit canonicity theorem stating that all closed terms of boolean type evaluate either to true or to false.

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

Connected through hyperedge HE-2 (induced by source paper "cellular cohomology in homotopy type theory"):
  with members:
    - "on higher inductive types in cubical type theory"
    - "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-3 (induced by source paper "on higher inductive types in cubical type theory"):
  with members:
    - "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"
    - "canonicity for cubical 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 "code generation for higher inductive types"):
  with members:
    - "on higher inductive types in cubical type theory"
    - "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"

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)