human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks"):
  Abstract: We investigate models of the mitogenactivated protein kinases (MAPK) network, with the aim of determining where in parameter space there exist multiple positive steady states. We build on recent progress which combines various symbolic computation methods for mixed systems of equalities and inequalities. We demonstrate that those techniques benefit tremendously from a newly implemented graph theoretical symbolic preprocessing method. We compare computation times and quality of results of numerical continuation methods with our symbolic approach before and after the application of our preprocessing.

Includes members:
  Member "a case study on the parametric occurrence of multiple steady states":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "truth table invariant cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "improving the use of equational constraints in cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "truth table invariant cylindrical algebraic decomposition by regular chains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "triangular decomposition of semi algebraic systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "smooth points on semi algebraic sets")
  Member "computing cylindrical algebraic decomposition via triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cylindrical algebraic decomposition with equational constraints")

Question: Please tell me which class the source paper 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)