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 about higher order relational specifications"
  Abstract: The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems that are commonly presented via syntax-directed rules that make use of contexts and side-conditions. The two-level logic approach, as implemented in the Abella theorem prover, embeds the HH specification logic within a rich reasoning logic that supports inductive and co-inductive definitions, an equality predicate, and generic quantification. Properties of the encoded systems can then be proved through the embedding, with special benefit being extracted from the transparent correspondence between HH derivations and those in the encoded formal systems. The versatility of HH relies on the free use of nested implications, leading to dynamically changing assumption sets in derivations. Realizing an induction principle in this situation is nontrivial and the original Abella system uses only a subset of HH for this reason. We develop a method here for supporting inductive reasoning over all of HH. Our approach relies on the ability to characterize dynamically changing contexts through finite inductive definitions, and on a modified encoding of backchaining for HH that allows these finite characterizations to be used in inductive arguments. We demonstrate the effectiveness of our approach through examples of formal reasoning on specifications with nested implications in an extended version of Abella.

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

Connected through hyperedge HE-2 (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"
    - "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"
    - "reasoning with higher order abstract syntax in a logical framework"

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

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)