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: "implementation of a near optimal complex root clustering algorithm"
  Abstract: We describe Ccluster, a software for computing natural $\epsilon$-clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al.~(2016) is near-optimal when applied to the benchmark problem of isolating all complex roots of an integer polynomial. It is one of the first implementations of a near-optimal algorithm for complex roots. We describe some low level techniques for speeding up the algorithm. Its performance is compared with the well-known MPSolve library and Maple.

Connected through hyperedge HE-1 (induced by source paper "new progress in univariate polynomial root finding"):
  with members:
    - "polynomial root clustering and explicit deflation"
    - "computing real roots of real polynomials and now for real"
    - "real polynomial root finding by means of matrix and polynomial iterations"
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "nearly optimal computations with structured matrices"
    - "a numerical algorithm for zero counting i complexity and accuracy"

Connected through hyperedge HE-2 (induced by source paper "new practical advances in polynomial root clustering"):
  with members:
    - "polynomial factorization is simple and helpful more so than it seems to be"
    - "computing real roots of real polynomials and now for real"
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "computing real roots of real polynomials"

Connected through hyperedge HE-3 (induced by source paper "polynomial factorization is simple and helpful more so than it seems to be"):
  with members:
    - "polynomial root clustering and explicit deflation"
    - "computing real roots of real polynomials and now for real"
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "nearly optimal computations with structured matrices"

Connected through hyperedge HE-4 (induced by source paper "clustering complex zeros of triangular system of polynomials"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"

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)