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 with higher order abstract syntax in a logical framework"
  Abstract: Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give high-level, modular, and formal specifications of many important judgments in the area of programming languages and inference systems. Given such specifications, it is natural to consider proving properties about the specified systems in the framework: for example, given the specification of evaluation for a functional programming language, prove that the language is deterministic or that evaluation preserves types. One challenge in developing a framework for such reasoning is that higher-order abstract syntax (HOAS), an elegant and declarative treatment of object-level abstraction and substitution, is difficult to treat in proofs involving induction. In this paper, we present a meta-logic that can be used to reason about judgments coded using HOAS; this meta-logic is an extension of a simple intuitionistic logic that admits higher-order quantification over simply typed lambda-terms (key ingredients for HOAS) as well as induction and a notion of definition. We explore the difficulties of formal meta-theoretic analysis of HOAS encodings by considering encodings of intuitionistic and linear logics, and formally derive the admissibility of cut for important subsets of these logics. We then propose an approach to avoid the apparent tradeoff between the benefits of higher-order abstract syntax and the ability to analyze the resulting encodings. We illustrate this approach through examples involving the simple functional and imperative programming languages PCF and PCF:=. We formally derive such properties as unicity of typing, subject reduction, determinacy of evaluation, and the equivalence of transition semantics and natural semantics presentations of evaluation.

Connected through hyperedge HE-1 (induced by source paper "formalization of metatheory of the quipper quantum programming language in a linear logic"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "an open challenge problem repository for systems supporting binders"
    - "reasoning about higher order relational specifications"
    - "quipper a scalable quantum programming language"
    - "an improved implementation and abstract interface for hybrid"
    - "the abella interactive theorem prover system description"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-2 (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"
    - "a two level logic approach to reasoning about computations"

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"
    - "a two level logic approach to reasoning about computations"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-4 (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"
    - "a two level logic approach to reasoning about computations"
    - "the abella interactive theorem prover system description"
    - "nominal logic programming"

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

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"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "a two level logic approach to reasoning about computations"):
  with members:
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the abella interactive theorem prover system description"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-8 (induced by source paper "proof search specifications of bisimulation and modal logics for the pi calculus"):
  with members:
    - "formalising the pi calculus using nominal logic"
    - "induction and co induction in sequent calculus"
    - "the bedwyr system for model checking over syntactic expressions"
    - "focusing and polarization in intuitionistic logic"
    - "natural deduction as higher order resolution"
    - "isabelle the next 700 theorem provers"

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)