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 "optimising problem formulation for cylindrical algebraic decomposition"):
  Abstract: Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of variables in the worst case, but the actual computation time can vary greatly. It is possible to offer different formulations for a given problem leading to great differences in tractability. In this paper we suggest a new measure for CAD complexity which takes into account the real geometry of the problem. This leads to new heuristics for choosing: the variable ordering for a CAD problem, a designated equational constraint, and formulations for truth-table invariant CADs (TTICADs). We then consider the possibility of using Grobner bases to precondition TTICAD and when such formulations constitute the creation of a new problem.

Includes members:
  Member "understanding branch cuts of expressions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using machine learning to improve cylindrical algebraic decomposition")
  Member "an implementation of cad in maple utilising mccallum projection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truth table invariant cylindrical algebraic decomposition")
  Member "cylindrical algebraic decompositions for boolean combinations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "a bi directional refinement algorithm for the calculus of co inductive constructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a type checker for a logical framework with union and intersection types")
  Member "program verification in the presence of complex numbers functions with branch cuts etc":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "computing cylindrical algebraic decomposition via triangular decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)