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: "ic3 modulo theories via implicit predicate abstraction"
  Abstract: We present a novel approach for generalizing the IC3 algorithm for invariant checking from finite-state to infinite-state transition systems, expressed over some background theories. The procedure is based on a tight integration of IC3 with Implicit (predicate) Abstraction, a technique that expresses abstract tran- sitions without computing explicitly the abstract system and is incremental with respect to the addition of predicates. In this scenario, IC3 operates only at the Boolean level of the abstract state space, discovering inductive clauses over the abstraction predicates. Theory reasoning is confined within the underlying SMT solver, and applied transparently when performing satisfiability checks. When the current abstraction allows for a spurious counterexample, it is refined by discov- ering and adding a sufficient set of new predicates. Importantly, this can be done in a completely incremental manner, without discarding the clauses found in the previous search. The proposed approach has two key advantages. First, unlike current SMT gener- alizations of IC3, it allows to handle a wide range of background theories without relying on ad-hoc extensions, such as quantifier elimination or theory-specific clause generalization procedures, which might not always be available, and can moreover be inefficient. Second, compared to a direct exploration of the concrete transition system, the use of abstraction gives a significant performance improve- ment, as our experiments demonstrate.

Connected through hyperedge HE-1 (induced by source paper "complexity and information in invariant inference"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "learning disjunctions of predicates"
    - "interactive program synthesis"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "abstract acceleration of general linear loops"
    - "tight bounds on proper equivalence query learning of dnf"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-2 (induced by source paper "pridemm a solver for relaxed memory models"):
  with members:
    - "an achilles heel of term resolution"
    - "on the quest for an acyclic graph"
    - "on thin air reads towards an event structures model of relaxed memory"
    - "overhauling sc atomics in c11 and opencl"
    - "syntax and analytic semantics of lisa"
    - "q resolution with generalized axioms"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-3 (induced by source paper "generalized property directed reachability for hybrid systems"):
  with members:
    - "sharper and simpler nonlinear interpolants for program verification"
    - "refinement type inference via horn constraint optimization"
    - "smt based induction methods for timed systems"
    - "computing semi algebraic invariants for polynomial dynamical systems"

Connected through hyperedge HE-4 (induced by source paper "property directed self composition"):
  with members:
    - "smt based model checking for recursive programs"

Connected through hyperedge HE-5 (induced by source paper "verifying reachability properties in markov chains via incremental induction"):
  with members:
    - "significant diagnostic counterexamples in probabilistic model checking"

Connected through hyperedge HE-6 (induced by source paper "the jkind model checker"):
  with members:
    - "efficient generation of inductive validity cores for safety properties"
    - "combining k induction with continuously refined invariants"
    - "requirements analysis of a quad redundant flight control system"
    - "pkind a parallel k induction based model checker"

Connected through hyperedge HE-7 (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"
    - "smt based model checking for recursive programs"

Connected through hyperedge HE-8 (induced by source paper "linear time temporal logic with event freezing functions"):
  with members:
    - "ltl with the freeze quantifier and register automata"

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)