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 "truth table invariant cylindrical algebraic decomposition by regular chains"):
  Abstract: A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae have constant truth value on each cell of the decomposition. Secondly, the computation uses regular chains theory to first build a cylindrical decomposition of complex space (CCD) incrementally by polynomial. Significant modification of the regular chains technology was used to achieve the more sophisticated invariance criteria. Experimental results on an implementation in the RegularChains Library for Maple verify that combining these advances gives an algorithm superior to its individual components and competitive with the state of the art.

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 "choosing a variable ordering for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using machine learning to improve cylindrical algebraic decomposition")
  Member "problem formulation for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "cylindrical algebraic sub decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "understanding branch cuts of expressions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using machine learning to improve cylindrical algebraic decomposition")
  Member "an implementation of cad in maple utilising problem formulation equational constraints and truth table invariance":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "truth table invariant cylindrical algebraic decomposition")
  Member "cylindrical algebraic decompositions for boolean combinations":
    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)