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: "introduction to the ginac framework for symbolic computation within the c programming language"
  Abstract: The traditional split-up into a low level language and a high level language in the design of computer algebra systems may become obsolete with the advent of more versatile computer languages. We describe GiNaC, a special-purpose system that deliberately denies the need for such a distinction. It is entirely written in C++ and the user can interact with it directly in that language. It was designed to provide efficient handling of multivariate polynomials, algebras and special functions that are needed for loop calculations in theoretical quantum field theory. It also bears some potential to become a more general purpose symbolic package.

Connected through hyperedge HE-1 (induced by source paper "on the fly optimization of parallel computation of symbolic symplectic invariants"):
  with members:
    - "the piranha algebraic manipulator"

Connected through hyperedge HE-2 (induced by source paper "parameter synthesis for markov models"):
  with members:
    - "shepherding hordes of markov chains"
    - "parameter independent strategies for pmdps via pomdps"
    - "sea param exploring schedulers in parametric mdps"
    - "multi objective robust strategy synthesis for interval markov decision processes"
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "reachability in augmented interval markov chains"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-3 (induced by source paper "automated derivation of parametric data movement lower bounds for affine programs"):
  with members:
    - "pushing the bounds for matrix matrix multiplication"
    - "on characterizing the data movement complexity of computational dags for parallel execution"
    - "minimizing communication in linear algebra"
    - "revisiting matrix product on master worker platforms"

Connected through hyperedge HE-4 (induced by source paper "stochy automated verification and synthesis of stochastic processes"):
  with members:
    - "efficiency through uncertainty scalable formal synthesis for stochastic hybrid systems"
    - "a user friendly hybrid sparse matrix class in c"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-5 (induced by source paper "moebinv c libraries for manipulations in non euclidean geometry"):
  with members:
    - "an extension of moebius lie geometry with conformal ensembles of cycles and its implementation in a ginac library"
    - "ensembles of cycles programmed in ginac"

Connected through hyperedge HE-6 (induced by source paper "snc a cloud service platform for symbolic numeric computation using just in time compilation"):
  with members:
    - "automated derivation of the adjoint of high level transient finite element programs"
    - "high performance cloud computing a view of scientific applications"

Connected through hyperedge HE-7 (induced by source paper "performance analysis of effective symbolic methods for solving band matrix slaes"):
  with members:
    - "a new algorithm for general cyclic heptadiagonal linear systems using sherman morrison woodbury formula"

Connected through hyperedge HE-8 (induced by source paper "certified roundoff error bounds using bernstein expansions and sparse krivine stengle representations"):
  with members:
    - "certified roundoff error bounds using semidefinite programming"
    - "towards a compiler for reals"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "certification of bounds on expressions involving rounded operators"

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)