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 "towards a symbolic summation theory for unspecified sequences"):
  Abstract: The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide such a simplification without exceptions. If it fails, it may suggest a more advanced simplification introducing in addition a single nested sum where the summand has to satisfy a particular constraint. More precisely, an explicitly given parameterized telescoping equation must hold. Restricting to the case that the arising unspecified sequences are specialized to the class of indefinite nested sums defined over hypergeometric, multi-basic or mixed hypergeometric products, it can be shown that this constraint is not only sufficient but also necessary.

Includes members:
  Member "representing q hypergeometric products and mixed versions in difference rings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "invariant generation for multi path loops with polynomial assignments")
  Member "algebraic independence of sequences generated by cyclotomic harmonic sums":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a difference ring theory for symbolic summation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "representing q hypergeometric products and mixed versions in difference rings")
  Member "fast algorithms for refined parameterized telescoping in difference fields":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a refined difference field theory for symbolic summation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")

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)