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 "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings"):
  Abstract: We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real arithmetic. The algorithm is a variant of Cylindrical Algebraic Decomposition (CAD) adapted for satisfiability, where solution candidates (sample points) are constructed incrementally, either until a satisfying sample is found or sufficient samples have been sampled to conclude unsatisfiability. The choice of samples is guided by the input constraints and previous conflicts. #R##N#The key idea behind our new approach is to start with a partial sample; demonstrate that it cannot be extended to a full sample; and from the reasons for that rule out a larger space around the partial sample, which build up incrementally into a cylindrical algebraic covering of the space. There are similarities with the incremental variant of CAD, the NLSAT method of Jovanovic and de~Moura, and the NuCAD algorithm of Brown; but we present worked examples and experimental results on a preliminary implementation to demonstrate the differences to these, and the benefits of the new approach.

Includes members:
  Member "cylindrical algebraic decomposition with equational constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved cross validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness")
  Member "using machine learning to improve cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "algorithmically generating new algebraic features of polynomial systems for machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved cross validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness")
  Member "improved cross validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness":
    also connected through other hyperedges:
      (none)
  Member "comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved cross validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness")
  Member "theoryguru a mathematica package to apply quantifier elimination technology to economics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "a case study on the parametric occurrence of multiple steady states":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cylindrical algebraic decomposition with equational constraints")
  Member "truth table invariant cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)