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: "a symbolic summation approach to find optimal nested sum representations"
  Abstract: We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over hypergeometric, $q$-hypergeometric or mixed hypergeometric expressions. Recently, our methods have found applications in quantum field theory.

Connected through hyperedge HE-1 (induced by source paper "minimal representations and algebraic relations for single nested products"):
  with members:
    - "a difference ring theory for symbolic summation"
    - "on the structure of compatible rational functions"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "fast computation of smith forms of sparse matrices over local rings"
    - "order degree curves for hypergeometric creative telescoping"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-2 (induced by source paper "algebraic independence of cyclotomic harmonic sums"):
  with members:
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"
    - "a difference ring theory for symbolic summation"
    - "the package harmonicsums computer algebra and analytic aspects of nested sums"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-3 (induced by source paper "algebraic independence of sequences generated by cyclotomic harmonic sums"):
  with members:
    - "a difference ring theory for symbolic summation"
    - "the package harmonicsums computer algebra and analytic aspects of nested sums"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "simplifying multiple sums in difference fields"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-4 (induced by source paper "a difference ring theory for symbolic summation"):
  with members:
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "simplifying multiple sums in difference fields"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-5 (induced by source paper "recent symbolic summation methods to solve coupled systems of differential and difference equations"):
  with members:
    - "simplifying multiple sums in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "advanced computer algebra algorithms for the expansion of feynman integrals"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-6 (induced by source paper "fast algorithms for refined parameterized telescoping in difference fields"):
  with members:
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "simplifying multiple sums in difference fields"
    - "desingularization explains order degree curves for ore operators"
    - "creative telescoping for holonomic functions"
    - "order degree curves for hypergeometric creative telescoping"
    - "a symbolic summation approach to feynman integral calculus"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-7 (induced by source paper "simplifying multiple sums in difference fields"):
  with members:
    - "order degree curves for hypergeometric creative telescoping"
    - "a symbolic summation approach to feynman integral calculus"
    - "advanced computer algebra algorithms for the expansion of feynman integrals"
    - "a fast approach to creative telescoping"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-8 (induced by source paper "advanced computer algebra algorithms for the expansion of feynman integrals"):
  with members:
    - "a symbolic summation approach to feynman integral calculus"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

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)