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 "algorithms for simultaneous pade approximations"):
  Abstract: We describe how to solve simultaneous Pade approximations over a power series ring K[[x]] for a field K using O~(nω - 1 d) operations in K, where d is the sought precision and $n$ is the number of power series to approximate. We develop two algorithms using different approaches. Both algorithms return a reduced sub-bases that generates the complete set of solutions to the input approximations problem that satisfy the given degree constraints. Our results are made possible by recent breakthroughs in fast computations of minimal approximant bases and Hermite Pade approximations.

Includes members:
  Member "fast computation of minimal interpolation bases in popov form for arbitrary shifts":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")
  Member "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast computation of approximant bases in canonical form")
  Member "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "change of basis for m primary ideals in one and two variables")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "generalised multi sequence shift register synthesis using module minimisation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "collaborative decoding of interleaved reed solomon codes and concatenated code designs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")

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)