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: "q resolution with generalized axioms"
  Abstract: Q-resolution is a proof system for quantified Boolean formulas (QBFs) in prenex conjunctive normal form (PCNF) which underlies search-based QBF solvers with clause and cube learning (QCDCL). With the aim to derive and learn stronger clauses and cubes earlier in the search, we generalize the axioms of the Q-resolution calculus resulting in an exponentially more powerful proof system. The generalized axioms introduce an interface of Q-resolution to any other QBF proof system allowing for the direct combination of orthogonal solving techniques. We implemented a variant of the Q-resolution calculus with generalized axioms in the QBF solver DepQBF. As two case studies, we apply integrated SAT solving and resource-bounded QBF preprocessing during the search to heuristically detect potential axiom applications. Experiments with application benchmarks indicate a substantial performance improvement.

Connected through hyperedge HE-1 (induced by source paper "graph neural reasoning may fail in certifying boolean unsatisfiability"):
  with members:
    - "evolvegcn evolving graph convolutional networks for dynamic graphs"
    - "what can neural networks reason about"
    - "graph neural reasoning for 2 quantified boolean formula solvers"
    - "neural symbolic vqa disentangling reasoning from vision and language understanding"
    - "learning a sat solver from single bit supervision"
    - "learning heuristics for automated reasoning through deep reinforcement learning"
    - "unsupervised learning of latent physical properties using perception prediction networks"
    - "deep sets"

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"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-3 (induced by source paper "on expansion and resolution in cegar based qbf solving"):
  with members:
    - "encodings of bounded synthesis"
    - "on stronger calculi for qbfs"
    - "detecting unrealizability of distributed fault tolerant systems"

Connected through hyperedge HE-4 (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"
    - "incrementally computing minimal unsatisfiable cores of qbfs via a clause group solver api"
    - "conformant planning as a case study of incremental qbf solving"
    - "incremental qbf solving"
    - "computing resolution path dependencies in linear time"
    - "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)