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: "incremental qbf solving"
  Abstract: We consider the problem of incrementally solving a sequence of quantified Boolean formulae (QBF). Incremental solving aims at using information learned from one formula in the process of solving the next formulae in the sequence. Based on a general overview of the problem and related challenges, we present an approach to incremental QBF solving which is application-independent and hence applicable to QBF encodings of arbitrary problems. We implemented this approach in our incremental search-based QBF solver DepQBF and report on implementation details. Experimental results illustrate the potential benefits of incremental solving in QBF-based workflows.

Connected through hyperedge HE-1 (induced by source paper "depqbf 6 0 a search based qbf solver beyond traditional qcdcl"):
  with members:
    - "evaluating qbf solvers quantifier alternations matter"
    - "the qbf gallery"
    - "q resolution with generalized axioms"
    - "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api"
    - "conformant planning as a case study of incremental qbf solving"
    - "computing resolution path dependencies in linear time"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-2 (induced by source paper "satisfiability based methods for reactive synthesis from safety specifications"):
  with members:
    - "the second reactive synthesis competition syntcomp 2015"
    - "abssynthe abstract synthesis from succinct safety specifications"
    - "synthesizing multiple boolean functions using interpolation on a single proof"
    - "alpaga a tool for solving parity games with imperfect information"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-3 (induced by source paper "the second reactive synthesis competition syntcomp 2015"):
  with members:
    - "the first reactive synthesis competition syntcomp 2014"
    - "specification format for reactive synthesis problems"
    - "compositional algorithms for succinct safety games"
    - "sat based methods for circuit synthesis"
    - "abssynthe abstract synthesis from succinct safety specifications"

Connected through hyperedge HE-4 (induced by source paper "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api"):
  with members:
    - "conformant planning as a case study of incremental qbf solving"
    - "a scalable algorithm for minimal unsatisfiable core extraction"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

Connected through hyperedge HE-5 (induced by source paper "automated benchmarking of incremental sat and qbf solvers"):
  with members:
    - "conformant planning as a case study of incremental qbf solving"

Connected through hyperedge HE-6 (induced by source paper "incremental cardinality constraints for maxsat"):
  with members:
    - "solving linux upgradeability problems using boolean optimization"
    - "cause clue clauses error localization using maximum satisfiability"
    - "algorithms for weighted boolean optimization"
    - "on using unsatisfiability for solving maximum satisfiability"

Connected through hyperedge HE-7 (induced by source paper "conformant planning as a case study of incremental qbf solving"):
  with members:
    - "on qbf proofs and preprocessing"
    - "compiling uncertainty away in conformant planning problems with bounded width"
    - "clause term resolution and learning in the evaluation of quantified boolean formulas"

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)