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: "accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic"
  Abstract: Numerical continuation methods track a solution path defined by a homotopy. The systems we consider are defined by polynomials in several variables with complex coefficients. For larger dimensions and degrees, the numerical conditioning worsens and hardware double precision becomes often insufficient to reach the end of the solution path. With double double and quad double arithmetic, we can solve larger problems that we could not solve with hardware double arithmetic, but at a higher computational cost. This cost overhead can be compensated by acceleration on a Graphics Processing Unit (GPU). We describe our implementation and report on computational results on benchmark polynomial systems.

Connected through hyperedge HE-1 (induced by source paper "solving polynomial systems in the cloud with polynomial homotopy continuation"):
  with members:
    - "tracking many solution paths of a polynomial homotopy on a graphics processing unit"
    - "a polyhedral method to compute all affine solution sets of sparse polynomial systems"
    - "practical graph isomorphism ii"
    - "modernizing phcpack through phcpy"
    - "computing puiseux series for algebraic surfaces"

Connected through hyperedge HE-2 (induced by source paper "tracking many solution paths of a polynomial homotopy on a graphics processing unit"):
  with members:
    - "gpu acceleration of newton s method for large systems of polynomial equations in double double and quad double arithmetic"
    - "modernizing phcpack through phcpy"
    - "orthogononalization on a general purpose graphics processing unit with double double and quad double arithmetic"
    - "evaluating polynomials in several variables and their derivatives on a gpu computing processor"

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)