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: "a two level logic approach to reasoning about computations"
  Abstract: Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory over relations as a language for specifying such notions. Our specification logic is further characterized by an ability to explicitly treat binding in object languages. Once such a logic is fixed, a natural next question is how we might prove theorems about specifications written in it. We propose to use a second logic, called a reasoning logic, for this purpose. A satisfactory reasoning logic should be able to completely encode the specification logic. Associated with the specification logic are various notions of binding: for quantifiers within formulas, for eigenvariables within sequents, and for abstractions within terms. To provide a natural treatment of these aspects, the reasoning logic must encode binding structures as well as their associated notions of scope, free and bound variables, and capture-avoiding substitution. Further, to support arguments about provability, the reasoning logic should possess strong mechanisms for constructing proofs by induction and co-induction. We provide these capabilities here by using a logic called G which represents relations over lambda-terms via definitions of atomic judgments, contains inference rules for induction and co-induction, and includes a special generic quantifier. We show how provability in the specification logic can be transparently encoded in G. We also describe an interactive theorem prover called Abella that implements G and this two-level logic approach and we present several examples that demonstrate the efficacy of Abella in reasoning about computations.

Connected through hyperedge HE-1 (induced by source paper "schematic polymorphism in the abella proof assistant"):
  with members:
    - "a higher order abstract syntax approach to the verified compilation of functional programs"
    - "a higher order abstract syntax approach to verified transformations on functional programs"
    - "reasoning with higher order abstract syntax in a logical framework"

Connected through hyperedge HE-2 (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"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-3 (induced by source paper "a higher order abstract syntax approach to the verified compilation of functional programs"):
  with members:
    - "a case study on logical relations using contextual types"
    - "the next 700 challenge problems for reasoning with higher order abstract syntax representations part 1 a common infrastructure for benchmarks"
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the abella interactive theorem prover system description"
    - "reasoning with higher order abstract syntax in a logical framework"

Connected through hyperedge HE-4 (induced by source paper "an open challenge problem repository for systems supporting binders"):
  with members:
    - "the next 700 challenge problems for reasoning with higher order abstract syntax representations part 1 a common infrastructure for benchmarks"
    - "reasoning about higher order relational specifications"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-5 (induced by source paper "the next 700 challenge problems for reasoning with higher order abstract syntax representations part 1 a common infrastructure for benchmarks"):
  with members:
    - "towards extracting explicit proofs from totality checking in twelf"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-6 (induced by source paper "reasoning about higher order relational specifications"):
  with members:
    - "a meta programming approach to realizing dependently typed logic programming"
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the abella interactive theorem prover system description"
    - "nominal logic programming"
    - "reasoning with higher order abstract syntax in a logical framework"

Connected through hyperedge HE-7 (induced by source paper "towards extracting explicit proofs from totality checking in twelf"):
  with members:
    - "a meta programming approach to realizing dependently typed logic programming"

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"
    - "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"
    - "the bedwyr system for model checking over syntactic expressions"
    - "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)