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: "smt based model checking for recursive programs"
  Abstract: We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both "over-" and "under-approximations" of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible counterexamples and detect convergence to a proof. We show that for programs and properties over a decidable theory, the algorithm is guaranteed to find a counterexample, if one exists. However, efficiency depends on an oracle for quantifier elimination (QE). For Boolean Programs, the algorithm is a polynomial decision procedure, matching the worst-case bounds of the best BDD-based algorithms. For Linear Arithmetic (integers and rationals), we give an efficient instantiation of the algorithm by applying QE "lazily". We use existing interpolation techniques to over-approximate QE and introduce "Model Based Projection" to under-approximate QE. Empirical evaluation on SV-COMP benchmarks shows that our algorithm improves significantly on the state-of-the-art.

Connected through hyperedge HE-1 (induced by source paper "proving properties of sorting programs a case study in horn clause verification"):
  with members:
    - "solving horn clauses on inductive data types without induction"
    - "predicate pairing for program verification"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"

Connected through hyperedge HE-2 (induced by source paper "property directed self composition"):
  with members:
    - "ic3 modulo theories via implicit predicate abstraction"

Connected through hyperedge HE-3 (induced by source paper "differentially testing soundness and precision of program analyzers"):
  with members:
    - "formal verification of a c value analysis based on abstract interpretation"
    - "automatic abstraction in smt based unbounded software model checking"
    - "stratified static analysis based on variable dependencies"
    - "cpachecker a tool for configurable software verification"
    - "the octagon abstract domain"

Connected through hyperedge HE-4 (induced by source paper "local refinement typing"):
  with members:
    - "refinement types for typescript"
    - "refinement reflection or how to turn your favorite language into a proof assistant using smt"
    - "program synthesis from polymorphic refinement types"
    - "refinement type inference via horn constraint optimization"
    - "occurrence typing modulo theories"
    - "hmc verifying functional programs using abstract interpreters"
    - "software model checking via large block encoding"

Connected through hyperedge HE-5 (induced by source paper "combining forward and backward abstract interpretation of horn clauses"):
  with members:
    - "program analysis with local policy iteration"
    - "automatic abstraction in smt based unbounded software model checking"
    - "pagai a path sensitive static analyzer"
    - "using bounded model checking to focus fixpoint iterations"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-6 (induced by source paper "verifying array manipulating programs by tiling"):
  with members:
    - "scaling bounded model checking by transforming programs with arrays"
    - "a simple abstraction of arrays and maps by program translation"
    - "abstract acceleration of general linear loops"

Connected through hyperedge HE-7 (induced by source paper "sygus techniques in the core of an smt solver"):
  with members:
    - "sygus comp 2016 results and analysis"
    - "results and analysis of sygus comp 15"

Connected through hyperedge HE-8 (induced by source paper "invariant checking of nra transition systems via incremental reduction to lra with euf"):
  with members:
    - "verifying the safety of a flight critical system"
    - "ic3 modulo theories via implicit predicate abstraction"

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)