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 puiseux series for algebraic surfaces"
  Abstract: In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface with as many coordinate planes as the dimension of the surface. Our approach starts with a polyhedral method to compute cones of normal vectors to the Newton polytopes of the given polynomial system that defines the surface. If as many vectors in the cone as the dimension of the surface define an initial form system that has isolated solutions, then those vectors are potential tropisms for the initial term of the Puiseux series expansion. Our preliminary methods produce exact representations for solution sets of the cyclic $n$-roots problem, for $n = m^2$, corresponding to a result of Backelin.

Connected through hyperedge HE-1 (induced by source paper "computing pretropisms for the cyclic n roots problem"):
  with members:
    - "exact gift wrapping to prune the tree of edges of newton polytopes to compute pretropisms"
    - "pruning algorithms for pretropisms of newton polytopes"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-2 (induced by source paper "computing all space curve solutions of polynomial systems by polyhedral methods"):
  with members:
    - "pruning algorithms for pretropisms of newton polytopes"
    - "modernizing phcpack through phcpy"

Connected through hyperedge HE-3 (induced by source paper "pruning algorithms for pretropisms of newton polytopes"):
  with members:
    - "computing pretropisms for the cyclic n roots problem"
    - "computing all space curve solutions of polynomial systems by polyhedral methods"
    - "exact gift wrapping to prune the tree of edges of newton polytopes to compute pretropisms"
    - "efficient edge skeleton computation for polytopes defined by oracles"
    - "efficient random walk methods for approximating polytope volume"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-4 (induced by source paper "accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic"):
  with members:
    - "solving polynomial systems in the cloud with polynomial homotopy continuation"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "solving polynomial systems in the cloud with polynomial homotopy continuation"):
  with members:
    - "accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "exact gift wrapping to prune the tree of edges of newton polytopes to compute pretropisms"):
  with members:
    - "efficient edge skeleton computation for polytopes defined by oracles"
    - "efficient random walk methods for approximating polytope volume"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-7 (induced by source paper "computing all affine solution sets of binomial systems"):
  with members:
    - "a polyhedral method to compute all affine solution sets of sparse polynomial systems"

Connected through hyperedge HE-8 (induced by source paper "a polyhedral method to compute all affine solution sets of sparse polynomial systems"):
  with members:
    - "modernizing phcpack through phcpy"

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)