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: "rigorous high precision computation of the hurwitz zeta function and its derivatives"
  Abstract: We study the use of the Euler-Maclaurin formula to numerically evaluate the Hurwitz zeta function $\zeta(s,a)$ for $s, a \in \mathbb{C}$, along with an arbitrary number of derivatives with respect to $s$, to arbitrary precision with rigorous error bounds. Techniques that lead to a fast implementation are discussed. We present new record computations of Stieltjes constants, Keiper-Li coefficients and the first nontrivial zero of the Riemann zeta function, obtained using an open source implementation of the algorithms described in this paper.

Connected through hyperedge HE-1 (induced by source paper "moments of interference in vehicular networks with hardcore headway distance"):
  with members:
    - "temporal correlation of interference and outage in mobile networks over one dimensional finite regions"
    - "performance of a link in a field of vehicular interferers with hardcore headway distance"
    - "an analytical framework for coverage in cellular networks leveraging vehicles"
    - "coverage analysis of a vehicular network modeled as cox process driven by poisson line process"
    - "user point processes in cellular networks"
    - "statistical modeling and probabilistic analysis of cellular networks with determinantal point processes"
    - "analytical modeling of uplink cellular networks"
    - "modeling and analysis of k tier downlink heterogeneous cellular networks"

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