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: "non wellfounded trees in homotopy type theory"
  Abstract: We prove a conjecture about the constructibility of conductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable. Indeed, in this work, we construct coinductive types in a subsystem of Homotopy Type Theory; this subsystem is given by Intensional Martin-Lof type theory with natural numbers and Voevodsky's Univalence Axiom. Our results are mechanized in the computer proof assistant Agda.

Connected through hyperedge HE-1 (induced by source paper "infinite types infinite data infinite interaction"):
  with members:
    - "bisimulation as path type for guarded recursive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "a linear category of polynomial functors extensional part"
    - "a linear category of polynomial diagrams"
    - "relating coalgebraic notions of bisimulation"
    - "programming interfaces and basic topology"
    - "representations of stream processors using nested fixed points"

Connected through hyperedge HE-2 (induced by source paper "from signatures to monads in unimath"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "heterogeneous substitution systems revisited"
    - "initial semantics for higher order typed syntax in coq"
    - "modules over monads and linearity"

Connected through hyperedge HE-3 (induced by source paper "type theory based on dependent inductive and coinductive types"):
  with members:
    - "guarded dependent type theory with coinductive types"
    - "dependent inductive and coinductive types are fibrational dialgebras"

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)