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 "recent advances in real geometric reasoning"):
  Abstract: In the 1930s Tarski showed that real quantifier elimination was possible, and in 1975 Collins gave a remotely practicable method, albeit with doubly-exponential complexity, which was later shown to be inherent. We discuss some of the recent major advances in Collins method: such as an alternative approach based on passing via the complexes, and advances which come closer to "solving the question asked" rather than "solving all problems to do with these polynomials".

Includes members:
  Member "truth table invariant cylindrical algebraic decomposition":
    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 by regular chains":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "choosing a variable ordering for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using machine learning to improve cylindrical algebraic decomposition")
  Member "cylindrical algebraic decomposition using local projections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "using the distribution of cells by dimension in a cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "problem formulation for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "using the regular chains library to build cylindrical algebraic decompositions by projecting and lifting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)