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: "arb efficient arbitrary precision midpoint radius interval arithmetic"
  Abstract: Arb is a C library for arbitrary-precision interval arithmetic using the midpoint-radius representation, also known as ball arithmetic. It supports real and complex numbers, polynomials, power series, matrices, and evaluation of many special functions. The core number types are designed for versatility and speed in a range of scenarios, allowing performance that is competitive with non-interval arbitrary-precision types such as MPFR and MPC floating-point numbers. We discuss the low-level number representation, strategies for precision and error bounds, and the implementation of efficient polynomial arithmetic with interval coefficients.

Connected through hyperedge HE-1 (induced by source paper "fungrim a symbolic library for special functions"):
  with members:
    - "digital repository of mathematical formulae"

Connected through hyperedge HE-2 (induced by source paper "numerical evaluation of elliptic functions elliptic integrals and modular forms"):
  with members:
    - "numerical integration in arbitrary precision ball arithmetic"
    - "nemo hecke computer algebra and number theory packages for the julia programming language"
    - "computing hypergeometric functions rigorously"
    - "efficient implementation of elementary functions in the medium precision range"
    - "the complexity of class polynomial computation via floating point approximations"

Connected through hyperedge HE-3 (induced by source paper "faster arbitrary precision dot product and matrix multiplication"):
  with members:
    - "julia a fresh approach to numerical computing"
    - "a fast algorithm for reversion of power series"

Connected through hyperedge HE-4 (induced by source paper "complexity of a root clustering algorithm"):
  with members:
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "on the complexity of solving a bivariate polynomial system"

Connected through hyperedge HE-5 (induced by source paper "clustering complex zeros of triangular system of polynomials"):
  with members:
    - "implementation of a near optimal complex root clustering algorithm"
    - "computing real roots of real polynomials and now for real"

Connected through hyperedge HE-6 (induced by source paper "numerical integration in arbitrary precision ball arithmetic"):
  with members:
    - "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights"

Connected through hyperedge HE-7 (induced by source paper "computing the lambert w function in arbitrary precision complex interval arithmetic"):
  with members:
    - "efficient implementation of elementary functions in the medium precision range"
    - "lambert w function for applications in physics"

Connected through hyperedge HE-8 (induced by source paper "computing hypergeometric functions rigorously"):
  with members:
    - "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights"
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "efficient implementation of elementary functions in the medium precision range"
    - "rigorous high precision computation of the hurwitz zeta function and its derivatives"
    - "evaluating parametric holonomic sequences using rectangular splitting"
    - "multiple precision evaluation of the airy ai function with reduced cancellation"
    - "numgfun a package for numerical and analytic computation with d finite functions"
    - "effective bounds for p recursive sequences"

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)