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 "problem formulation for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition"):
  Abstract: Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with respect to the truth of logical formulae rather than the signs of polynomials; and CAD construction by regular chains technology, where first a complex decomposition is constructed by refining a tree incrementally by constraint. We here consider how best to formulate problems for input to this algorithm. We focus on a choice (not relevant for other CAD algorithms) about the order in which constraints are presented. We develop new heuristics to help make this choice and thus allow the best use of the algorithm in practice. We also consider other choices of problem formulation for CAD, as discussed in CICM 2013, revisiting these in the context of the new algorithm.

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 "understanding branch cuts of expressions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "truth table invariant cylindrical algebraic decomposition")
  Member "cylindrical algebraic decompositions for boolean combinations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "optimising problem formulation for cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "an incremental algorithm for computing cylindrical algebraic decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using machine learning to improve cylindrical algebraic decomposition")
  Member "program verification in the presence of complex numbers functions with branch cuts etc":
    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)