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: "wave equation numerical resolution a comprehensive mechanized proof of a c program"
  Abstract: We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and floating-point computations lead to round-off errors. We annotate this C program to specify both method error and round-off error. We use Frama-C to generate theorems that guarantee the soundness of the code. We discharge these theorems using SMT solvers, Gappa, and Coq. This involves a large Coq development to prove the adequacy of the C program to the numerical scheme and to bound errors. To our knowledge, this is the first time such a numerical analysis program is fully machine-checked.

Connected through hyperedge HE-1 (induced by source paper "automatic generation and verification of test stable floating point code"):
  with members:
    - "eliminating unstable tests in floating point programs"
    - "towards a compiler for reals"
    - "robustness analysis of finite precision implementations"
    - "a logical product approach to zonotope intersection"
    - "relational abstract domains for the detection of floating point run time errors"

Connected through hyperedge HE-2 (induced by source paper "quantitative continuity and computable analysis in coq"):
  with members:
    - "type two polynomial time and restricted lookahead"
    - "bounded time computation on metric spaces and banach spaces"
    - "representations and evaluation strategies for feasibly approximable functions"
    - "parametrised second order complexity theory with applications to the study of interval computation"
    - "comparing representations for function spaces in computable analysis"
    - "function spaces for second order polynomial time"
    - "complexity theory for operators in analysis"
    - "essential incompleteness of arithmetic verified by coq"

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"
    - "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 "sound mixed precision optimization with rewriting"):
  with members:
    - "on sound relative error bounds for floating point arithmetic"
    - "certified roundoff error bounds using semidefinite programming"
    - "towards a compiler for reals"
    - "robustness analysis of finite precision implementations"
    - "synthesis of minimal error control software"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (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"
    - "certification of bounds on expressions involving rounded operators"

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)