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: "computing the multilinear factors of lacunary polynomials without heights"
  Abstract: We present a deterministic polynomial-time algorithm which computes the multilinear factors of multivariate lacunary polynomials over number elds. It is based on a new Gap theorem which allows to test whether P (X) = P k=1 ajX j (vX + t) j (uX + w) j is identically zero in polynomial time. Previous algorithms for this task were based on Gap Theorems expressed in terms of the height of the coecients. Our Gap Theorem is based on the valuation of the polynomial and is valid for any eld of characteristic zero. As a consequence we obtain a faster and more elementary algorithm. Furthermore, we can partially extend the algorithm to other situations, such as absolute and approximate factorizations.

Connected through hyperedge HE-1 (induced by source paper "what can and can t we do with sparse polynomials"):
  with members:
    - "bounded degree factors of lacunary multivariate polynomials"
    - "output sensitive algorithms for sumset and sparse polynomial multiplication"
    - "parallel sparse interpolation using small primes"
    - "sparse interpolation over finite fields via low order roots of unity"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster polynomial multiplication over finite fields"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"

Connected through hyperedge HE-2 (induced by source paper "bounded degree factors of lacunary multivariate polynomials"):
  with members:
    - "lacunaryx computing bounded degree factors of lacunary polynomials"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "computing low degree factors of lacunary polynomials a newton puiseux approach"
    - "even faster integer multiplication"
    - "factoring bivariate lacunary polynomials without heights"
    - "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-3 (induced by source paper "lacunaryx computing bounded degree factors of lacunary polynomials"):
  with members:
    - "bounded degree factors of lacunary multivariate polynomials"
    - "computing low degree factors of lacunary polynomials a newton puiseux approach"
    - "factoring bivariate lacunary polynomials without heights"

Connected through hyperedge HE-4 (induced by source paper "computing low degree factors of lacunary polynomials a newton puiseux approach"):
  with members:
    - "factoring bivariate lacunary polynomials without heights"
    - "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem"

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)