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 "on cdcl based proof systems with the ordered decision strategy"):
  Abstract: We prove that conflict-driven clause learning SAT-solvers with the ordered decision strategy and the DECISION learning scheme are equivalent to ordered resolution. We also prove that, by replacing this learning scheme with its opposite that stops after the first new clause when backtracking, they become equivalent to general resolution. To the best of our knowledge, this is the first theoretical study of the interplay between specific decision strategies and clause learning. #R##N#For both results, we allow nondeterminism in the solver's ability to perform unit propagation, conflict analysis, and restarts, in a way that is similar to previous works in the literature. To aid the presentation of our results, and possibly future research, we define a model and language for discussing CDCL-based proof systems that allows for succinct and precise theorem statements.

Includes members:
  Member "understanding vsids branching heuristics in conflict driven clause learning sat solvers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improving sat solver heuristics with graph networks and reinforcement learning")
  Member "improved separations of regular resolution from clause learning proof systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards a complexity theoretic understanding of restarts in sat solvers")
  Member "resolution trees with lemmas resolution refinements that characterize dll algorithms with clause learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "small stone in pool")
  Member "towards understanding and harnessing the potential of clause learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subsumption driven clause learning with dpll restarts")

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)