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 "a verified certificate checker for finite precision error bounds in coq and hol4"):
  Abstract: Being able to soundly estimate roundoff errors of finite-precision computations is important for many applications in embedded systems and scientific computing. Due to the discrepancy between continuous reals and discrete finite-precision values, automated static analysis tools are highly valuable to estimate roundoff errors. The results, however, are only as correct as the implementations of the static analysis tools. This paper presents a formally verified and modular tool which fully automatically checks the correctness of finite-precision roundoff error bounds encoded in a certificate. We present implementations of certificate generation and checking for both Coq and HOL4 and evaluate it on a number of examples from the literature. The experiments use both in-logic evaluation of Coq and HOL4, and execution of extracted code outside of the logics: we benchmark Coq extracted unverified OCaml code and a CakeML-generated verified binary.

Includes members:
  Member "on sound relative error bounds for floating point arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sound mixed precision optimization with rewriting")
  Member "certified roundoff error bounds using semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact optimization via sums of nonnegative circuits and sums of am gm exponentials")
  Member "a linear first order functional intermediate language for verified compilers":
    also connected through other hyperedges:
      (none)
  Member "towards a compiler for reals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automatic generation and verification of test stable floating point code")
  Member "formal verification of nonlinear inequalities with taylor interval approximations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deciding univariate polynomial problems using untrusted certificates in isabelle hol")
  Member "robustness analysis of finite precision implementations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automatic generation and verification of test stable floating point code")
  Member "wave equation numerical resolution a comprehensive mechanized proof of a c program":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automatic generation and verification of test stable floating point code")
  Member "certification of bounds on expressions involving rounded operators":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "abstract compilation for verification of numerical accuracy properties")

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.PL(Programming Languages)