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: "robustness analysis of finite precision implementations"
  Abstract: A desirable property of control systems is to be robust to inputs, that is small perturbations of the inputs of a system will cause only small perturbations on its outputs. But it is not clear whether this property is maintained at the implementation level, when two close inputs can lead to very different execution paths. The problem becomes particularly crucial when considering finite precision implementations, where any elementary computation can be affected by a small error. In this context, almost every test is potentially unstable, that is, for a given input, the computed (finite precision) path may differ from the ideal (same computation in real numbers) path. Still, state-of-the-art error analyses do not consider this possibility and rely on the stable test hypothesis, that control flows are identical. If there is a discontinuity between the treatments in the two branches, that is the conditional block is not robust to uncertainties, the error bounds can be unsound. #R##N#We propose here a new abstract-interpretation based error analysis of finite precision implementations, which is sound in presence of unstable tests. It automatically bounds the discontinuity error coming from the difference between the float and real values when there is a path divergence, and introduces a new error term labeled by the test that introduced this potential discontinuity. This gives a tractable error analysis, implemented in our static analyzer FLUCTUAT: we present results on representative extracts of control programs.

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"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "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 "perfectly parallel fairness certification of neural networks"):
  with members:
    - "probabilistic verification of fairness properties via concentration"
    - "a provable defense for deep residual networks"
    - "a survey on bias and fairness in machine learning"
    - "analyzing deep neural networks with symbolic propagation towards higher precision and faster verification"
    - "the efficacy of shield under different threat models"
    - "deepsearch simple and effective blackbox fuzzing of deep neural networks"
    - "formal security analysis of neural networks using symbolic intervals"
    - "symbolic execution for deep neural networks"

Connected through hyperedge HE-3 (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"
    - "the pitfalls of verifying floating point computations"
    - "certification of bounds on expressions involving rounded operators"

Connected through hyperedge HE-4 (induced by source paper "sound approximation of programs with elementary functions"):
  with members:
    - "sound mixed precision optimization with rewriting"
    - "certified roundoff error bounds using semidefinite programming"
    - "towards a compiler for reals"

Connected through hyperedge HE-5 (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"
    - "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-6 (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"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "synthesis of minimal error control software"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "towards a compiler for reals"):
  with members:
    - "on the maximum relative error when computing x n in floating point arithmetic"
    - "a non local method for robustness analysis of floating point programs"
    - "a logical product approach to zonotope intersection"
    - "relational abstract domains for the detection of floating point run time errors"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-8 (induced by source paper "on numerical error propagation with sensitivity"):
  with members:
    - "a non local method for robustness analysis of floating point programs"
    - "a logical product approach to zonotope intersection"
    - "relational abstract domains for the detection of floating point run time errors"
    - "a static analyzer for large safety critical software"

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.SE(Software Engineering)