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: "combining generic judgments with recursive definitions"
  Abstract: Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that allow direct, logic-based reasoning about such descriptions: the treatment of atomic judgments as fixed points (recursive definitions) and an encoding of binding constructs via generic judgments. However, the logics encompassing these two features have thus far treated them orthogonally: that is, they do not provide the ability to define object-logic properties that themselves depend on an intrinsic treatment of binding. We propose a new and simple integration of these features within an intuitionistic logic enhanced with induction over natural numbers and we show that the resulting logic is consistent. The pivotal benefit of the integration is that it allows recursive definitions to not just encode simple, traditional forms of atomic judgments but also to capture generic properties pertaining to such judgments. The usefulness of this logic is illustrated by showing how it can provide elegant treatments of object-logic contexts that appear in proofs involving typing calculi and of arbitrarily cascading substitutions that play a role in reducibility arguments.

Connected through hyperedge HE-1 (induced by source paper "functional programming with λ tree syntax"):
  with members:
    - "reasoning about higher order relational specifications"
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-2 (induced by source paper "a case study on logical relations using contextual types"):
  with members:
    - "reasoning in abella about structural operational semantics specifications"
    - "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-3 (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"
    - "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-4 (induced by source paper "relating nominal and higher order abstract syntax specifications"):
  with members:
    - "reasoning in abella about structural operational semantics specifications"
    - "the abella interactive theorem prover system description"
    - "the bedwyr system for model checking over syntactic expressions"
    - "nominal logic programming"

Connected through hyperedge HE-5 (induced by source paper "a meta programming approach to realizing dependently typed logic programming"):
  with members:
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-6 (induced by source paper "a framework for specifying prototyping and reasoning about computational systems"):
  with members:
    - "least and greatest fixed points in linear logic"
    - "reasoning in abella about structural operational semantics specifications"
    - "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-7 (induced by source paper "hybrid a definitional two level approach to reasoning with higher order abstract syntax"):
  with members:
    - "reasoning in abella about structural operational semantics specifications"
    - "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-8 (induced by source paper "reasoning in abella about structural operational semantics specifications"):
  with members:
    - "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"

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)