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: "reasoning in abella about structural operational semantics specifications"
  Abstract: The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties in generic judgments. Further, object language specifications are embedded directly into the reasoning framework through recursive definitions. The treatment of binding via generic judgments implicitly enforces distinctness and atomicity in the names used for bound variables. These properties must, however, be made explicit in reasoning tasks. This objective can be achieved by allowing recursive definitions to also specify generic properties of atomic predicates. The utility of these various logical features in the Abella system is demonstrated through actual reasoning tasks. Brief comparisons with a few other logic based approaches are also made.

Connected through hyperedge HE-1 (induced by source paper "a case study on logical relations using contextual types"):
  with members:
    - "combining generic judgments with recursive definitions"
    - "the abella interactive theorem prover system description"
    - "mechanizing the metatheory of lf"
    - "on equivalence and canonical forms in the lf type theory"

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"
    - "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"
    - "mechanizing coinduction and corecursion in higher order logic"

Connected through hyperedge HE-3 (induced by source paper "relating nominal and higher order abstract syntax specifications"):
  with members:
    - "combining generic judgments with recursive definitions"
    - "the abella interactive theorem prover system description"
    - "the bedwyr system for model checking over syntactic expressions"
    - "nominal logic programming"

Connected through hyperedge HE-4 (induced by source paper "a framework for specifying prototyping and reasoning about computational systems"):
  with members:
    - "least and greatest fixed points in linear logic"
    - "combining generic judgments with recursive definitions"
    - "the abella interactive theorem prover system description"
    - "hybrid a definitional two level approach to reasoning with higher order abstract syntax"
    - "cut elimination for a logic with generic judgments and induction"
    - "the bedwyr system for model checking over syntactic expressions"
    - "nominal logic programming"
    - "reasoning with higher order abstract syntax in a logical framework"

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

Connected through hyperedge HE-6 (induced by source paper "the abella interactive theorem prover system description"):
  with members:
    - "least and greatest fixed points in linear logic"
    - "combining generic judgments with recursive definitions"
    - "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)