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 "visualizing planar and space implicit real algebraic curves with singularities"):
  Abstract: We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing space curve in higher-dimensional space. Since the topology of a curve near a singular point of it is not numerically stable, we trace only the curve outside neighborhoods of singular points and replace each neighborhood simply by a point, which produces a polygonal approximation that is $\epsilon$-close to the curve. Such an approximation is more stable for defining the numerical connectedness of the complement of the projection of the curve in $\mathbb{R}^2$, which is important for applications such as solving bi-parametric polynomial systems. The algorithm starts by computing three types of key points of the curve, namely the intersection of the curve with small spheres centered at singular points, regular critical points of every connected components of the curve, as well as intersection points of the curve with the given bounding box. It then traces the curve starting with and in the order of the above three types of points. This basic scheme is further enhanced by several optimizations, such as grouping singular points in natural clusters, tracing the curve by a try-and-resume strategy and handling "pseudo singular points". The effectiveness of the algorithm is illustrated by numerous examples. This manuscript extends our preliminary results that appeared in CASC 2018.

Includes members:
  Member "complete subdivision algorithms ii isotopic meshing of singular algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of subdivision for diameter distance tests")
  Member "triangular decomposition of semi algebraic systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "smooth points on semi algebraic sets")

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)