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: "extracting verified decision procedures dpll and resolution"
  Abstract: This article is concerned with the application of the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction. To this end, we formalize a completeness proof for the DPLL proof system and extract a SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation showing its unsatisfiability. We use non-computational quantifiers to remove redundant computational content from the extracted program and translate it into Haskell to improve performance. We also prove the equivalence between the resolution proof system and the DPLL proof system with a bound on the size of the resulting resolution proof. This demonstrates that it is possible to capture quantitative information about the extracted program on the proof level. The formalization is carried out in the interactive proof assistant Minlog.

Connected through hyperedge HE-1 (induced by source paper "up to techniques for branching bisimilarity"):
  with members:
    - "divide and congruence iii from decomposition of modal formulas to preservation of stability and divergence"
    - "distributive laws for monotone specifications"
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "weak bisimulation for coalgebras over order enriched monads"

Connected through hyperedge HE-2 (induced by source paper "an algorithmic approach to the existence of ideal objects in commutative algebra"):
  with members:
    - "extension by conservation sikorski s theorem"
    - "sequential algorithms and the computational content of classical proofs"
    - "spector bar recursion over finite partial functions"
    - "induction in algebra a first case study"
    - "interactive learning based realizability for heyting arithmetic with em1"

Connected through hyperedge HE-3 (induced by source paper "computational interpretations of classical reasoning from the epsilon calculus to stateful programs"):
  with members:
    - "spector bar recursion over finite partial functions"
    - "applying godel s dialectica interpretation to obtain a constructive proof of higman s lemma"
    - "existential witness extraction in classical realizability and via a negative translation"
    - "interactive learning based realizability for heyting arithmetic with em1"

Connected through hyperedge HE-4 (induced by source paper "multiphase linear ranking functions and their relation to recurrent sets"):
  with members:
    - "on multiphase linear ranking functions"
    - "geometric nontermination arguments"
    - "ranking templates for linear loops"
    - "non termination analysis of java bytecode"
    - "eventual linear ranking functions"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-5 (induced by source paper "a storm is coming a modern probabilistic model checker"):
  with members:
    - "parameter synthesis for markov models faster than ever"
    - "high level counterexamples for probabilistic automata"
    - "safety constrained reinforcement learning for mdps"
    - "permissive controller synthesis for probabilistic systems"
    - "analysis of timed and long run objectives for markov automata"
    - "verification of markov decision processes using learning algorithms"
    - "a robust class of data languages and an application to learning"

Connected through hyperedge HE-6 (induced by source paper "on multiphase linear ranking functions"):
  with members:
    - "ranking templates for linear loops"
    - "proving termination starting from the end"
    - "eventual linear ranking functions"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-7 (induced by source paper "geometric nontermination arguments"):
  with members:
    - "t2 temporal property verification"
    - "ranking templates for linear loops"
    - "termination analysis by learning terminating programs"
    - "on termination of integer linear loops"
    - "unrestricted termination and non termination arguments for bit vector programs"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-8 (induced by source paper "a cirquent calculus system with clustering and ranking"):
  with members:
    - "the computational complexity of propositional cirquent calculus"
    - "a propositional system induced by japaridze s approach to if logic"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "from formulas to cirquents in computability logic"
    - "the countable versus uncountable branching recurrences in computability logic"
    - "soundness and completeness of the cirquent calculus system cl6 for computability logic"
    - "in the beginning was game semantics"

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)