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 "lacunaryx computing bounded degree factors of lacunary polynomials"):
  Abstract: In this paper, we report on an implementation in the free software M athemagix  [9] of lacunary factorization algorithms, distributed as a library called L acunaryx . These algorithms take as input a polynomial in sparse representation, that is as a list of nonzero monomials, and an integer d, and compute its degree-d factors.2 The complexity of these algorithms is polynomial in the sparse size of the input polynomial and d: The sparse size of a polynomial [EQUATION] logwhere the h(·) denotes the height of a rational number, that is the maximum of the absolute values of its numerator and denominator.

Includes members:
  Member "bounded degree factors of lacunary multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "what can and can t we do with sparse polynomials")
  Member "computing low degree factors of lacunary polynomials a newton puiseux approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounded degree factors of lacunary multivariate polynomials")
  Member "factoring bivariate lacunary polynomials without heights":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "what can and can t we do with sparse polynomials")
  Member "computing the multilinear factors of lacunary polynomials without heights":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what can and can t we do with sparse polynomials")

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.MS(Mathematical Software)