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: "mechanizing coinduction and corecursion in higher order logic"
  Abstract: A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; corecursion expresses functions that yield elements of coinductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also. The theory is illustrated using finite and infinite lists. Corecursion expresses functions over infinite lists; coinduction reasons about such functions.

Connected through hyperedge HE-1 (induced by source paper "formalising mathematics in simple type theory"):
  with members:
    - "computational logic its origins and applications"
    - "formalization of the fundamental group in untyped set theory using auto2"
    - "natural deduction as higher order resolution"
    - "constructing recursion operators in intuitionistic type theory"

Connected through hyperedge HE-2 (induced by source paper "formal languages formally and coinductively"):
  with members:
    - "foundational extensible corecursion"

Connected through hyperedge HE-3 (induced by source paper "alice an advanced logic for interactive component engineering"):
  with members:
    - "model driven testing of time sensitive distributed systems"

Connected through hyperedge HE-4 (induced by source paper "cut elimination for a logic with induction and co induction"):
  with members:
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "least and greatest fixed points in linear logic"
    - "a two level logic approach to reasoning about computations"
    - "reasoning in abella about structural operational semantics specifications"
    - "combining generic judgments with recursive definitions"
    - "the abella interactive theorem prover system description"
    - "induction and co induction in sequent calculus"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-5 (induced by source paper "using structural recursion for corecursion"):
  with members:
    - "inductive and coinductive components of corecursive functions in coq"

Connected through hyperedge HE-6 (induced by source paper "inductive and coinductive components of corecursive functions in coq"):
  with members:
    - "affine functions and series with co inductive real numbers"
    - "general recursion via coinductive types"

Connected through hyperedge HE-7 (induced by source paper "bootstrapping inductive and coinductive types in hascasl"):
  with members:
    - "set theory for verification ii induction and recursion"

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)