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: "sparse fglm algorithms"
  Abstract: Given a zero-dimensional ideal $I \subset \kx$ of degree $D$, the transformation of the ordering of its \grobner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving process. Thus it is of crucial importance to design efficient algorithms to perform the change of ordering. The main contributions of this paper are several efficient methods for the change of ordering which take advantage of the sparsity of multiplication matrices in the classical {\sf FGLM} algorithm. Combing all these methods, we propose a deterministic top-level algorithm that automatically detects which method to use depending on the input. As a by-product, we have a fast implementation that is able to handle ideals of degree over $40000$. Such an implementation outperforms the {\sf Magma} and {\sf Singular} ones, as shown by our experiments. First for the shape position case, two methods are designed based on the Wiedemann algorithm: the first is probabilistic and its complexity to complete the change of ordering is $O(D(N_1+n\log (D)))$, where $N_1$ is the number of nonzero entries of a multiplication matrix; the other is deterministic and computes the LEX \grobner basis of $\sqrt{I}$ via Chinese Remainder Theorem. Then for the general case, the designed method is characterized by the Berlekamp--Massey--Sakata algorithm from Coding Theory to handle the multi-dimensional linearly recurring relations. Complexity analyses of all proposed methods are also provided. Furthermore, for generic polynomial systems, we present an explicit formula for the estimation of the sparsity of one main multiplication matrix, and prove its construction is free. With the asymptotic analysis of such sparsity, we are able to show for generic systems the complexity above becomes $O(\sqrt{6/n \pi} D^{2+\frac{n-1}{n}})$.

Connected through hyperedge HE-1 (induced by source paper "on the chordality of polynomial sets in triangular decomposition in top down style"):
  with members:
    - "chordal networks of polynomial ideals"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "sparse grobner bases the unmixed case"
    - "on the efficiency of solving boolean polynomial systems with the characteristic set method"
    - "on the complexity of solving quadratic boolean systems"
    - "a new algorithmic scheme for computing characteristic sets"

Connected through hyperedge HE-2 (induced by source paper "chordal graphs in triangular decomposition in top down style"):
  with members:
    - "on the chordality of polynomial sets in triangular decomposition in top down style"
    - "towards mixed grobner basis algorithms the multihomogeneous and sparse case"
    - "chordal networks of polynomial ideals"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "sparse grobner bases the unmixed case"
    - "a new algorithmic scheme for computing characteristic sets"

Connected through hyperedge HE-3 (induced by source paper "block krylov techniques in the context of sparse fglm algorithms"):
  with members:
    - "algorithms for zero dimensional ideals using linear recurrent sequences"
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "polynomial systems solving by fast linear algebra"
    - "on the complexity of the generalized minrank problem"

Connected through hyperedge HE-4 (induced by source paper "algorithms for zero dimensional ideals using linear recurrent sequences"):
  with members:
    - "in depth comparison of the berlekamp massey sakata and the scalar fglm algorithms the non adaptive variants"
    - "polynomial systems solving by fast linear algebra"
    - "symmetric tensor decomposition"

Connected through hyperedge HE-5 (induced by source paper "in depth comparison of the berlekamp massey sakata and the scalar fglm algorithms the non adaptive variants"):
  with members:
    - "symmetric tensor decomposition"

Connected through hyperedge HE-6 (induced by source paper "real root finding for low rank linear matrices"):
  with members:
    - "determinantal sets singularities and application to optimal control in medical imagery"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
    - "real root finding for rank defects in linear hankel matrices"
    - "real root finding for determinants of linear matrices"
    - "polynomial systems solving by fast linear algebra"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"

Connected through hyperedge HE-7 (induced by source paper "real root finding for determinants of linear matrices"):
  with members:
    - "polynomial systems solving by fast linear algebra"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "critical points and gr obner bases the unmixed case"
    - "on the complexity of the generalized minrank problem"

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)