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: "the bedwyr system for model checking over syntactic expressions"
  Abstract: Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search. The first is centered on the fact that both finite success and finite failure can be captured in the sequent calculus by incorporating inference rules for definitions that allow fixed points to be explored. As a result, proof search in such a sequent calculus can capture simple model checking problems as well as may and must behavior in operational semantics. The second is that higher-order abstract syntax is directly supported using term-level $\lambda$-binders and the $\nabla$ quantifier. These features allow reasoning directly on expressions containing bound variables.

Connected through hyperedge HE-1 (induced by source paper "a characterisation of open bisimulation using an intuitionistic modal logic"):
  with members:
    - "modal logics for nominal transition systems"
    - "a bisimilarity congruence for the applied pi calculus sufficiently coarse to verify privacy properties"
    - "generating witness of non bisimilarity for the pi calculus"
    - "the applied pi calculus mobile values new names and secure communication"
    - "a two level logic approach to reasoning about computations"

Connected through hyperedge HE-2 (induced by source paper "a proof theory for model checking an extended abstract"):
  with members:
    - "cut elimination for a logic with induction and co induction"
    - "least and greatest fixed points in linear logic"

Connected through hyperedge HE-3 (induced by source paper "generating witness of non bisimilarity for the pi calculus"):
  with members:
    - "a characterisation of open bisimulation using an intuitionistic modal logic"

Connected through hyperedge HE-4 (induced by source paper "advances in property based testing for alpha prolog"):
  with members:
    - "a framework for proof certificates in finite state exploration"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"
    - "general bindings and alpha equivalence in nominal isabelle"
    - "coinductive big step operational semantics"
    - "nominal logic programming"
    - "higher order pattern complement and the strict λ calculus"

Connected through hyperedge HE-5 (induced by source paper "a hybrid linear logic for constrained transition systems"):
  with members:
    - "a logical framework for systems biology"
    - "a hybrid linear logic for constrained transition systems with applications to molecular biology"
    - "a framework for specifying prototyping and reasoning about computational systems"

Connected through hyperedge HE-6 (induced by source paper "a framework for proof certificates in finite state exploration"):
  with members:
    - "least and greatest fixed points in linear logic"

Connected through hyperedge HE-7 (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"
    - "induction and co induction in sequent calculus"

Connected through hyperedge HE-8 (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"
    - "mechanizing coinduction and corecursion in higher order logic"

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)