human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "evaluating qbf solvers quantifier alternations matter"):
  Abstract: We present an experimental study of the effects of quantifier alternations on the evaluation of quantified Boolean formula (QBF) solvers. The number of quantifier alternations in a QBF in prenex conjunctive normal form (PCNF) is directly related to the theoretical hardness of the respective QBF satisfiability problem in the polynomial hierarchy. We show empirically that the performance of solvers based on different solving paradigms substantially varies depending on the numbers of alternations in PCNFs. In related theoretical work, quantifier alternations have become the focus of understanding the strengths and weaknesses of various QBF proof systems implemented in solvers. Our results motivate the development of methods to evaluate orthogonal solving paradigms by taking quantifier alternations into account. This is necessary to showcase the broad range of existing QBF solving paradigms for practical QBF applications. Moreover, we highlight the potential of combining different approaches and QBF proof systems in solvers.

Includes members:
  Member "on expansion and resolution in cegar based qbf solving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "size cost and capacity a semantic technique for hard random qbfs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short proofs for some symmetric quantified boolean formulas")
  Member "depqbf 6 0 a search based qbf solver beyond traditional qcdcl":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "the qbf gallery":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")
  Member "proof complexity modulo the polynomial hierarchy understanding alternation as a source of hardness":
    also connected through other hyperedges:
      (none)
  Member "meditations on quantified constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "qcsp monsters and the demise of the chen conjecture")
  Member "clause term resolution and learning in the evaluation of quantified boolean formulas":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "qratpre effective qbf preprocessing via strong redundancy properties")

Question: Please tell me which class the source paper 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)