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 bindings and alpha equivalence in nominal isabelle"
  Abstract: Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem#N#prover. It provides a proving infrastructure for reasoning about programming#N#language calculi involving named bound variables (as opposed to de-Bruijn#N#indices). In this paper we present an extension of Nominal Isabelle for dealing#N#with general bindings, that means term constructors where multiple variables#N#are bound at once. Such general bindings are ubiquitous in programming language#N#research and only very poorly supported with single binders, such as#N#lambda-abstractions. Our extension includes new definitions of#N#alpha-equivalence and establishes automatically the reasoning infrastructure#N#for alpha-equated terms. We also prove strong induction principles that have#N#the usual variable convention already built in.

Connected through hyperedge HE-1 (induced by source paper "modal logics for nominal transition systems"):
  with members:
    - "a characterisation of open bisimulation using an intuitionistic modal logic"
    - "distinguishing between communicating transactions"
    - "psi calculi a framework for mobile processes with nominal data and logic"

Connected through hyperedge HE-2 (induced by source paper "a formalized general theory of syntax with bindings"):
  with members:
    - "encoding monomorphic and polymorphic types"

Connected through hyperedge HE-3 (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"
    - "coinductive big step operational semantics"
    - "the bedwyr system for model checking over syntactic expressions"
    - "nominal logic programming"
    - "higher order pattern complement and the strict λ calculus"

Connected through hyperedge HE-4 (induced by source paper "nominal unification of higher order expressions with recursive let"):
  with members:
    - "graph isomorphism in quasipolynomial time"
    - "nominal unification from a higher order perspective"
    - "nominal logic programming"

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)