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: "general recursion via coinductive types"
  Abstract: A fertile field of research in theoretical computer science investigates the rep- resentation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations, implementation of operational semantics, formalization of domain theory, and inductive definition of domain predicates. Here, a different solution is proposed: exploiting coinductive types to model infinite com- putations. To every type A we associate a type of partial elements A � , coinductively generated by two constructors: the first, p aq just returns an element a: A; the second, ⊲ x, adds a computation step to a recursive element x: A � . We show how this simple device is sufficient to formalize all recursive functions between two given types. It allows the definition of fixed points of finitary, that is, continuous, operators. We will compare this approach to different ones from the literature. Finally, we mention that the formalization, with appropriate structural maps, defines a strong monad.

Connected through hyperedge HE-1 (induced by source paper "soundness conditions for big step semantics"):
  with members:
    - "coaxioms flexible coinductive definitions by inference systems"
    - "java lambda a featherweight story"
    - "flag based big step semantics"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-2 (induced by source paper "qed at large a survey of engineering of formally verified software"):
  with members:
    - "bridging the gap between programming languages and hardware weak memory models"
    - "automatic software repair a bibliography"
    - "the redprl proof assistant invited paper"
    - "verifying strong eventual consistency in distributed systems"
    - "algebraic foundations of proof refinement"
    - "deep network guided proof search"
    - "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc"
    - "gradual certified programming in coq"

Connected through hyperedge HE-3 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses"):
  with members:
    - "coinductive uniform proofs"
    - "towards coinductive theory exploration in horn clause logic position paper"
    - "breaking the loop recursive proofs for coinductive predicates in fibrations"
    - "productive corecursion in logic programming"
    - "guarded dependent type theory with coinductive types"
    - "proof relevant corecursive resolution"
    - "refinement type inference via horn constraint optimization"
    - "sequent calculus in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "interaction trees representing recursive and impure programs in coq"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"
    - "programming with algebraic effects and handlers"
    - "handling algebraic effects"
    - "a coinductive calculus for asynchronous side effecting processes"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-5 (induced by source paper "an adequate while language for hybrid computation"):
  with members:
    - "a semantics for hybrid iteration"
    - "a metalanguage for guarded iteration"
    - "compositional semantics for new paradigms probabilistic hybrid and beyond"
    - "continuity as a computational effect"
    - "intensionality definability and computation"

Connected through hyperedge HE-6 (induced by source paper "intrinsically typed mechanized semantics for session types"):
  with members:
    - "depending on session typed processes"
    - "using session types as an effect system"

Connected through hyperedge HE-7 (induced by source paper "interaction trees representing recursive and impure programs in coq work in progress"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"

Connected through hyperedge HE-8 (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"
    - "quotient inductive inductive types"
    - "guarded cubical type theory path equality for guarded recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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)