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 "algebraic independence of sequences generated by cyclotomic harmonic sums"):
  Abstract: An expression in terms of (cyclotomic) harmonic sums can be simplified by the quasi-shuffle algebra in terms of the so-called basis sums. By construction, these sums are algebraically independent within the quasi-shuffle algebra. In this article we show that the basis sums can be represented within a tower of difference ring extensions where the constants remain unchanged. This property enables one to embed this difference ring for the (cyclotomic) harmonic sums into the ring of sequences. This construction implies that the sequences produced by the basis sums are algebraically independent over the rational sequences adjoined with the alternating sequence.

Includes members:
  Member "a difference ring theory for symbolic summation":
    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 "the package harmonicsums computer algebra and analytic aspects of nested sums":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "towards a symbolic summation theory for unspecified sequences")
  Member "simplifying multiple sums in difference fields":
    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 "fast algorithms for refined parameterized telescoping in difference fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a symbolic summation approach to find optimal nested sum representations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "minimal representations and algebraic relations for single nested products")
  Member "parameterized telescoping proves algebraic independence of sums":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "a refined difference field theory for symbolic summation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)