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 "minimal representations and algebraic relations for single nested products"):
  Abstract: Recently, it has been shown constructively how a finite set of hypergeometric products, multibasic hypergeometric products or their mixed versions can be modeled properly in the setting of formal difference rings. Here special emphasis is put on robust constructions: whenever further products have to be considered, one can reuse --up to some mild modifications-- the already existing difference ring. In this article we relax this robustness criteria and seek for another form of optimality. We will elaborate a general framework to represent a finite set of products in a formal difference ring where the number of transcendental product generators is minimal. As a bonus we are able to describe explicitly all relations among the given input products.

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 "on the structure of compatible rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an effective framework for constructing exponent lattice basis of nonzero algebraic numbers")
  Member "creative telescoping for holonomic functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear differential equations as a data structure")
  Member "fast algorithms for refined parameterized telescoping 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 computation of smith forms of sparse matrices over local rings":
    also connected through other hyperedges:
      (none)
  Member "order degree curves for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational creative telescoping")
  Member "a symbolic summation approach to find optimal nested sum representations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algebraic independence of cyclotomic harmonic sums")
  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")

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)