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: "formal verification of nonlinear inequalities with taylor interval approximations"
  Abstract: We present a formal tool for verification of multivariate nonlinear inequalities. Our verification method is based on interval arithmetic with Taylor approximations. Our tool is implemented in the HOL Light proof assistant and it is capable to verify multivariate nonlinear polynomial and non-polynomial inequalities on rectangular domains. One of the main features of our work is an efficient implementation of the verification procedure which can prove non-trivial high-dimensional inequalities in several seconds. We developed the verification tool as a part of the Flyspeck project (a formal proof of the Kepler conjecture). The Flyspeck project includes about 1000 nonlinear inequalities. We successfully tested our method on more than 100 Flyspeck inequalities and estimated that the formal verification procedure is about 3000 times slower than an informal verification method implemented in C++. We also describe future work and prospective optimizations for our method.

Connected through hyperedge HE-1 (induced by source paper "deciding univariate polynomial problems using untrusted certificates in isabelle hol"):
  with members:
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"

Connected through hyperedge HE-2 (induced by source paper "certified roundoff error bounds using bernstein expansions and sparse krivine stengle representations"):
  with members:
    - "certified roundoff error bounds using semidefinite programming"
    - "towards a compiler for reals"
    - "certification of bounds on expressions involving rounded operators"
    - "introduction to the ginac framework for symbolic computation within the c programming language"

Connected through hyperedge HE-3 (induced by source paper "a verified certificate checker for finite precision error bounds in coq and hol4"):
  with members:
    - "on sound relative error bounds for floating point arithmetic"
    - "certified roundoff error bounds using semidefinite programming"
    - "a linear first order functional intermediate language for verified compilers"
    - "towards a compiler for reals"
    - "robustness analysis of finite precision implementations"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "certification of bounds on expressions involving rounded operators"
    - "a static analyzer for large safety critical software"

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"
    - "delta complete decision procedures for satisfiability over the reals"
    - "efficient solving of quantified inequality constraints over the real numbers"

Connected through hyperedge HE-5 (induced by source paper "distant decimals of pi"):
  with members:
    - "certified exact transcendental real number computation in coq"

Connected through hyperedge HE-6 (induced by source paper "certified roundoff error bounds using semidefinite programming"):
  with members:
    - "nlcertify a tool for formal nonlinear optimization"
    - "formal proofs for nonlinear optimization"
    - "a logical product approach to zonotope intersection"
    - "certification of bounds on expressions involving rounded operators"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "formal proofs for nonlinear optimization"):
  with members:
    - "nlcertify a tool for formal nonlinear optimization"
    - "certification of bounds of non linear functions the templates method"

Connected through hyperedge HE-8 (induced by source paper "nlcertify a tool for formal nonlinear optimization"):
  with members:
    - "formal proofs for nonlinear optimization"

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)