human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "computations modulo regular chains"
  Abstract: The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular methods and fast polynomial arithmetic. Our strategies take also advantage of the context in which these operations are performed. We report on extensive experimentation, comparing our code to pre-existing Maple implementations, as well as more optimized Magma functions. In most cases, our new code outperforms the other packages by several orders of magnitude.

Connected through hyperedge HE-1 (induced by source paper "using the regular chains library to build cylindrical algebraic decompositions by projecting and lifting"):
  with members:
    - "truth table invariant cylindrical algebraic decomposition"
    - "truth table invariant cylindrical algebraic decomposition by regular chains"
    - "problem formulation for truth table invariant cylindrical algebraic decomposition by incremental triangular decomposition"
    - "cylindrical algebraic sub decompositions"
    - "understanding branch cuts of expressions"
    - "an implementation of cad in maple utilising mccallum projection"
    - "an implementation of cad in maple utilising problem formulation equational constraints and truth table invariance"
    - "cylindrical algebraic decompositions for boolean combinations"

Connected through hyperedge HE-2 (induced by source paper "algorithms for computing triangular decompositions of polynomial systems"):
  with members:
    - "triangular decomposition of semi algebraic systems"
    - "computing cylindrical algebraic decomposition via triangular decomposition"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of computing with zero dimensional triangular sets"):
  with members:
    - "homotopy methods for multiplication modulo triangular sets"

Connected through hyperedge HE-4 (induced by source paper "triangular decomposition of semi algebraic systems"):
  with members:
    - "algorithms for computing triangular decompositions of polynomial systems"
    - "bit size estimates for triangular sets in positive dimension"
    - "computing cylindrical algebraic decomposition via triangular decomposition"

Question: Please tell me which class the center node 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)