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: "certification of bounds on expressions involving rounded operators"
  Abstract: Gappa uses interval arithmetic to certify bounds on mathematical expressions that involve rounded as well as exact operators. Gappa generates a theorem with its proof for each bound treated. The proof can be checked with a higher order logic automatic proof checker, either Coq or HOL Light, and we have developed a large companion library of verified facts for Coq dealing with the addition, multiplication, division, and square root, in fixed- and floating-point arithmetics. Gappa uses multiple-precision dyadic fractions for the endpoints of intervals and performs forward error analysis on rounded operators when necessary. When asked, Gappa reports the best bounds it is able to reach for a given expression in a given context. This feature is used to quickly obtain coarse bounds. It can also be used to identify where the set of facts and automatic techniques implemented in Gappa becomes insufficient. Gappa handles seamlessly additional properties expressed as interval properties or rewriting rules in order to establish more intricate bounds. Recent work showed that Gappa is perfectly suited to the proof of correctness of small pieces of software. Proof obligations can be written by designers, produced by third-party tools or obtained by overloading arithmetic operators.

Connected through hyperedge HE-1 (induced by source paper "abstract compilation for verification of numerical accuracy properties"):
  with members:
    - "eliminating unstable tests in floating point programs"
    - "finding root causes of floating point error with herbgrind"
    - "verificarlo checking floating point accuracy through monte carlo arithmetic"
    - "robustness analysis of finite precision implementations"
    - "the pitfalls of verifying floating point computations"

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"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "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"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "robustness analysis of finite precision implementations"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "on sound relative error bounds for floating point arithmetic"):
  with members:
    - "certified roundoff error bounds using semidefinite programming"
    - "on the maximum relative error when computing x n in floating point arithmetic"
    - "towards a compiler for reals"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"

Connected through hyperedge HE-5 (induced by source paper "interval enclosures of upper bounds of roundoff errors using semidefinite programming"):
  with members:
    - "certified roundoff error bounds using bernstein expansions and sparse krivine stengle representations"
    - "certified roundoff error bounds using semidefinite programming"

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"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "a logical product approach to zonotope intersection"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "wave equation numerical resolution a comprehensive mechanized proof of a c program"):
  with members:
    - "proof irrelevant model of cc with predicative induction and judgmental equality"
    - "type classes for efficient exact real arithmetic in coq"
    - "a computer verified monadic functional implementation of the integral"
    - "formal proof of a wave equation resolution scheme the method error"
    - "certified exact transcendental real number computation in coq"
    - "a decision procedure for linear big o equations"

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.MS(Mathematical Software)