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: "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.

Connected through hyperedge HE-1 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications"):
  with members:
    - "polynomial linear system solving with errors by simultaneous polynomial reconstruction of interleaved reed solomon codes"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-2 (induced by source paper "fast computation of approximant bases in canonical form"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "computing minimal interpolation bases"
    - "powers of tensors and fast matrix multiplication"
    - "faster polynomial multiplication over finite fields"

Connected through hyperedge HE-3 (induced by source paper "computing canonical bases of modules of univariate relations"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix"
    - "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "computing minimal interpolation bases"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-4 (induced by source paper "decoding of interleaved reed solomon codes using improved power decoding"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "power decoding of reed solomon codes revisited"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-5 (induced by source paper "improved power decoding of one point hermitian codes"):
  with members:
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "sub quadratic decoding of one point hermitian codes"
    - "power decoding reed solomon codes up to the johnson radius"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"

Connected through hyperedge HE-6 (induced by source paper "simultaneous partial inverses and decoding interleaved reed solomon codes"):
  with members:
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "coding for combined block symbol error correction"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "reduced complexity collaborative decoding of interleaved reed solomon and gabidulin codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-7 (induced by source paper "power decoding reed solomon codes up to the johnson radius"):
  with members:
    - "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "sub quadratic decoding of one point hermitian codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "coding for combined block symbol error correction"
    - "power decoding of reed solomon codes revisited"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"

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)