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: "computing hypergeometric functions rigorously"
  Abstract: We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions ${}_0F_1$, ${}_1F_1$, ${}_2F_1$ and ${}_2F_0$ (or the Kummer $U$-function) are supported for unrestricted complex parameters and argument, and by extension, we cover exponential and trigonometric integrals, error functions, Fresnel integrals, incomplete gamma and beta functions, Bessel functions, Airy functions, Legendre functions, Jacobi polynomials, complete elliptic integrals, and other special functions. The output can be used directly for interval computations or to generate provably correct floating-point approximations in any format. Performance is competitive with earlier arbitrary-precision software, and sometimes orders of magnitude faster. We also partially cover the generalized hypergeometric function ${}_pF_q$ and computation of high-order parameter derivatives.

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"
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "efficient implementation of elementary functions in the medium precision range"
    - "the complexity of class polynomial computation via floating point approximations"

Connected through hyperedge HE-2 (induced by source paper "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights"):
  with members:
    - "fast approximate polynomial multipoint evaluation and applications"
    - "evaluating parametric holonomic sequences using rectangular splitting"

Connected through hyperedge HE-3 (induced by source paper "arb efficient arbitrary precision midpoint radius interval arithmetic"):
  with members:
    - "efficient implementation of elementary functions in the medium precision range"
    - "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)