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: "quotient inductive inductive types"
  Abstract: Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the sense of HoTT (i.e. do not satisfy uniqueness of equality proofs) such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define sets, such as the Cauchy reals, the partiality monad, and the internal, total syntax of type theory. In each of these examples we define several types that depend on each other mutually, i.e. they are inductive-inductive definitions. We call those HITs quotient inductive-inductive types (QIITs). #R##N#Although there has been recent progress on the general theory of HITs, there isn't yet a theoretical foundation of the combination of equality constructors and induction-induction, despite having many interesting applications. In the present paper we present a first step towards a semantic definition of QIITs. In particular, we give an initial-algebra semantics and show that this is equivalent to the section induction principle, which justifies the intuitively expected elimination rules.

Connected through hyperedge HE-1 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming"):
  with members:
    - "an application of computable distributions to the semantics of probabilistic programs"
    - "formalising real numbers in homotopy type theory"
    - "stack semantics of type theory"
    - "a convenient category for higher order probability theory"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "the hott library a formalization of homotopy type theory in coq"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"

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"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "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 "signatures and induction principles for higher inductive inductive types"):
  with members:
    - "on higher inductive types in cubical type theory"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "type theory based on dependent inductive and coinductive types"
    - "higher inductive types as homotopy initial algebras"

Connected through hyperedge HE-4 (induced by source paper "constructing infinitary quotient inductive types"):
  with members:
    - "higher inductive types as homotopy initial algebras"
    - "type based termination inflationary fixed points and mixed inductive coinductive types"

Connected through hyperedge HE-5 (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"
    - "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"
    - "computational higher type theory iii univalent universes and exact equality"
    - "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 "denotational semantics of recursive types in synthetic guarded domain theory"):
  with members:
    - "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"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "general recursion via coinductive types"

Connected through hyperedge HE-8 (induced by source paper "partiality revisited the partiality monad as a quotient inductive inductive type"):
  with members:
    - "formalising real numbers in homotopy type theory"
    - "stack semantics of type theory"
    - "higher inductive types as homotopy initial algebras"
    - "general recursion via coinductive types"

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)