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: "induction and co induction in sequent calculus"
  Abstract: Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic (rather than set-theoretic) notion of definition. Definitions are akin to (stratified) logic programs, where the left and right rules for defined atoms allow one to view theories as "closed" or defining fixed points. The use of definitions makes it possible to reason intensionally about syntax, in particular enforcing free equality via unification. We add in a consistent way rules for pre and post fixed points, thus allowing the user to reason inductively and co-inductively about properties of computational system making full use of higher-order abstract syntax. Consistency is guaranteed via cut-elimination, where we give the first, to our knowledge, cut-elimination procedure in the presence of general inductive and co-inductive definitions.

Connected through hyperedge HE-1 (induced by source paper "combining deduction modulo and logics of fixed point definitions"):
  with members:
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "least and greatest fixed points in linear logic"
    - "the abella interactive theorem prover system description"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-2 (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"
    - "the bedwyr system for model checking over syntactic expressions"
    - "mechanizing coinduction and corecursion in higher order logic"

Connected through hyperedge HE-3 (induced by source paper "least and greatest fixed points in linear logic"):
  with members:
    - "cut elimination for a logic with induction and co induction"
    - "least and greatest fixpoints in game semantics"
    - "the bedwyr system for model checking over syntactic expressions"
    - "focusing and polarization in intuitionistic logic"

Connected through hyperedge HE-4 (induced by source paper "proof search specifications of bisimulation and modal logics for the pi calculus"):
  with members:
    - "formalising the pi calculus using nominal logic"
    - "the bedwyr system for model checking over syntactic expressions"
    - "focusing and polarization in intuitionistic logic"
    - "natural deduction as higher order resolution"
    - "reasoning with higher order abstract syntax in a logical framework"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-5 (induced by source paper "combining generic judgments with recursive definitions"):
  with members:
    - "the abella interactive theorem prover system description"
    - "cut elimination for a logic with generic judgments and induction"
    - "the bedwyr system for model checking over syntactic expressions"
    - "reasoning with higher order abstract syntax in a logical framework"

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)