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: "delta complete decision procedures for satisfiability over the reals"
  Abstract: We introduce the notion of "\delta-complete decision procedures" for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including transcendental functions and solutions of Lipschitz-continuous ODEs. Given an SMT problem \varphi and a positive rational number \delta, a \delta-complete decision procedure determines either that \varphi is unsatisfiable, or that the "\delta-weakening" of \varphi is satisfiable. Here, the \delta-weakening of \varphi is a variant of \varphi that allows \delta-bounded numerical perturbations on \varphi. We prove the existence of \delta-complete decision procedures for bounded SMT over reals with functions mentioned above. For functions in Type 2 complexity class C, under mild assumptions, the bounded \delta-SMT problem is in NP^C. \delta-Complete decision procedures can exploit scalable numerical methods for handling nonlinearity, and we propose to use this notion as an ideal requirement for numerically-driven decision procedures. As a concrete example, we formally analyze the DPLL  framework, which integrates Interval Constraint Propagation (ICP) in DPLL(T), and establish necessary and sufficient conditions for its \delta-completeness. We discuss practical applications of \delta-complete decision procedures for correctness-critical applications including formal verification and theorem proving.

Connected through hyperedge HE-1 (induced by source paper "optimization and abstraction a synergistic approach for analyzing neural network robustness"):
  with members:
    - "formal security analysis of neural networks using symbolic intervals"
    - "an overview of vulnerabilities of voice controlled systems"
    - "robust physical world attacks on deep learning models"
    - "an approach to reachability analysis for feed forward relu neural networks"
    - "output range analysis for deep neural networks"
    - "towards practical verification of machine learning the case of computer vision systems"
    - "deepxplore automated whitebox testing of deep learning systems"
    - "deepsafe a data driven approach for checking adversarial robustness in neural networks"

Connected through hyperedge HE-2 (induced by source paper "a cdcl style calculus for solving non linear constraints"):
  with members:
    - "efficient solution of a class of quantified constraints with quantifier prefix exists forall"

Connected through hyperedge HE-3 (induced by source paper "delta decision procedures for exists forall problems over the reals"):
  with members:
    - "a literature survey of benchmark functions for global optimisation problems"
    - "delta decidability over the reals"
    - "optimization in smt with la q cost functions"
    - "applications of quantified constraint solving over the reals bibliography"

Connected through hyperedge HE-4 (induced by source paper "satisfiability modulo transcendental functions via incremental linearization"):
  with members:
    - "invariant checking of nra transition systems via incremental reduction to lra with euf"
    - "nlcertify a tool for formal nonlinear optimization"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "efficient solving of quantified inequality constraints over the real numbers"

Connected through hyperedge HE-5 (induced by source paper "robust abstractions for control synthesis completeness via robustness for linear time properties"):
  with members:
    - "computing finite abstractions with robustness margins via local reachable set over approximation"

Connected through hyperedge HE-6 (induced by source paper "a heuristic prover for real inequalities"):
  with members:
    - "a formally verified proof of the central limit theorem"
    - "combining decision procedures for the reals"
    - "a formally verified proof of the prime number theorem"

Connected through hyperedge HE-7 (induced by source paper "revisiting the complexity of stability of continuous and hybrid systems"):
  with members:
    - "delta decidability over the reals"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"

Connected through hyperedge HE-8 (induced by source paper "proof generation from delta decisions"):
  with members:
    - "formal verification of nonlinear inequalities with taylor interval approximations"

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)