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: "efficient implementation of elementary functions in the medium precision range"
  Abstract: We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3 for cos to 30 for atan. Our implementation uses table-based argument reduction together with rectangular splitting to evaluate Taylor series. We collect denominators to reduce the number of divisions in the Taylor series, and avoid overhead by doing all multiprecision arithmetic using the mpn layer of the GMP library. Our implementation provides rigorous error bounds.

Connected through hyperedge HE-1 (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"
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "the complexity of class polynomial computation via floating point approximations"

Connected through hyperedge HE-2 (induced by source paper "computing the lambert w function in arbitrary precision complex interval arithmetic"):
  with members:
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "lambert w function for applications in physics"

Connected through hyperedge HE-3 (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"
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "arb efficient arbitrary precision midpoint radius interval arithmetic"):
  with members:
    - "computing hypergeometric functions rigorously"
    - "rigorous high precision computation of the hurwitz zeta function and its derivatives"
    - "a fast algorithm for reversion of power series"
    - "the complexity of class polynomial computation via floating point approximations"

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)