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 "satisfiability modulo transcendental functions via incremental linearization"):
  Abstract: In this paper we present an abstraction-refinement approach to Satisfiability Modulo the theory of transcendental functions, such as exponentiation and trigonometric functions. The transcendental functions are represented as uninterpreted in the abstract space, which is described in terms of the combined theory of linear arithmetic on the rationals with uninterpreted functions, and are incrementally axiomatized by means of upper- and lower-bounding piecewise-linear functions. Suitable numerical techniques are used to ensure that the abstractions of the transcendental functions are sound even in presence of irrationals. Our experimental evaluation on benchmarks from verification and mathematics demonstrates the potential of our approach, showing that it compares favorably with delta-satisfiability/interval propagation and methods based on theorem proving.

Includes members:
  Member "invariant checking of nra transition systems via incremental reduction to lra with euf":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automated synthesis of safe and robust pid controllers for stochastic hybrid systems")
  Member "nlcertify a tool for formal nonlinear optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "certified roundoff error bounds using semidefinite programming")
  Member "formal verification of nonlinear inequalities with taylor interval approximations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deciding univariate polynomial problems using untrusted certificates in isabelle hol")
  Member "delta complete decision procedures for satisfiability over the reals":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimization and abstraction a synergistic approach for analyzing neural network robustness")
  Member "efficient solving of quantified inequality constraints over the real numbers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simulation based computation of certificates for safety of dynamical systems")

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)