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: "towards a compiler for reals"
  Abstract: Numerical software, common in scientific computing or embedded systems, inevitably uses an approximation of the real arithmetic in which most algorithms are designed. In many domains, roundoff errors are not the only source of inaccuracy and measurement and other input errors further increase the uncertainty of the computed results. Adequate tools are needed to help users select suitable approximations, especially for safety-critical applications. #R##N#We present the source-to-source compiler Rosa which takes as input a real-valued program with error specifications and synthesizes code over an appropriate floating-point or fixed-point data type. The main challenge of such a compiler is a fully automated, sound and yet accurate enough numerical error estimation. We present a unified technique for floating-point and fixed-point arithmetic of various precisions which can handle nonlinear arithmetic, determine closed- form symbolic invariants for unbounded loops and quantify the effects of discontinuities on numerical errors. We evaluate Rosa on a number of benchmarks from scientific computing and embedded systems and, comparing it to state-of-the-art in automated error estimation, show it presents an interesting trade-off between accuracy and performance.

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"
    - "robustness analysis of finite precision implementations"
    - "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 "combining learning and optimization for transprecision computing"):
  with members:
    - "adam a method for stochastic optimization"
    - "changing computing paradigms towards power efficiency"

Connected through hyperedge HE-3 (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"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "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-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"
    - "robustness analysis of finite precision implementations"

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"
    - "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"
    - "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"
    - "robustness analysis of finite precision implementations"
    - "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 "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"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "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.PL(Programming Languages)