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: "a simple algorithm for the evaluation of the hypergeometric series using quasi linear time and linear space"
  Abstract: A simple algorithm with time complexity O(M(n)log(n) 2 ) and space complexity O(n) for the evaluation of the hypergeometric series with rational coefficients is con- structed (M(n) being the complexity of integer multiplication). It is shown that this algorithm is suitable in practical informatics for constructive analogues of often used constants of analysis. Introduction. In this paper we construct an algorithm for the calculation of the approximate values of the hypergeometric series with rational coefficients whose imple- mentation is simple and which is quasi-linear in time and linear in space on the machine Schonhage (1). Such series are used for the calculation of some mathematical constants of analysis and of the values of elementary functions at rational points. Sch(FQLIN − TIME//LIN − SPACE) will be used to denote the class of algo- rithms which are computable on Schonhage and are quasi-linear in time and linear in space. The main feature of Schonhage is its ability to execute recursive calls of proce- dures. Quasi-linear means that the complexity function is bounded by O(nlog(n) k ) for some k. The main advantage of algorithms based on series expansions is the relative simplic- ity of both the algorithms and the analysis of their computational complexity. Besides we can compute all the most commonly used constants of analysis using series expan- sions. For calculations with a small number of digits after the binary (or decimal) point, series are more efficient than other methods because of the small constants in estima- tions of their computational complexity. Therefore such algorithms are important in computer science for practical applications. It is known (2) that linearly convergent hypergeometric series with rational coef- ficients can be calculated using the binary splitting method with time complexity O(M(n)(log(n)) 2 ) and space complexity O(nlog(n)) (where M(n) denotes the com- plexity of multiplication of n-bit integers). In recent publications, for example (3), algorithms based on a modified binary splitting method for the evaluation of linearly convergent hypergeometric series with time complexity O(M(n)(log(n)) 2 ) and space complexity O(n) are described.

Connected through hyperedge HE-1 (induced by source paper "a note on the space complexity of fast d finite function evaluation"):
  with members:
    - "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.DS(Data Structures and Algorithms)