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: "generic regular decompositions for generic zero dimensional systems"
  Abstract: Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm is proposed for computing a generic regular decomposition and the associated RDU variety of a given generic zero-dimensional system simultaneously. The solutions of the given system can be expressed by finitely many zero-dimensional regular chains if the parameter value is not on the RDU variety. #R##N#The so called weakly relatively simplicial decomposition plays a crucial role in the algorithm, which is based on the theories of subresultant chains. Furthermore, the algorithm can be naturally adopted to compute a non-redundant Wu's decomposition and the decomposition is stable at any parameter value that is not on the RDU variety. The algorithm has been implemented with Maple 15 and experimented with a number of benchmarks from the literature. Empirical results are also presented to show the good performance of the algorithm.

Connected through hyperedge HE-1 (induced by source paper "hierarchical comprehensive triangular decomposition"):
  with members:
    - "generic regular decompositions for parametric polynomial systems"
    - "triangular decomposition of semi algebraic systems"

Connected through hyperedge HE-2 (induced by source paper "generic regular decompositions for parametric polynomial systems"):
  with members:
    - "triangular decomposition of semi algebraic systems"

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)