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 grobner bases the unmixed case"
  Abstract: Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a semigroup algebra, i.e. an algebra generated by a subset of Laurent monomials. In order to solve symbolically sparse systems, we introduce sparse Grobner bases, an analog of classical Grobner bases for semigroup algebras, and we propose sparse variants of the F5 and FGLM algorithms to compute them. Our prototype "proof-of-concept" implementation shows large speedups (more than 100 for some examples) compared to optimized (classical) Grobner bases software. Moreover, in the case where the generating subset of monomials corresponds to the points with integer coordinates in a normal lattice polytope P ⊂ Rn and under regularity assumptions, we prove complexity bounds which depend on the combinatorial properties of P. These bounds yield new estimates on the complexity of solving 0-dim systems where all polynomials share the same Newton polytope (unmixed case). For instance, we generalize the bound min(n1, n2) + 1 on the maximal degree in a Grobner basis of a 0-dim. bilinear system with blocks of variables of sizes (n1, n2) to the multilinear case: Σ ni - max(ni) + 1. We also propose a variant of Froberg's conjecture which allows us to estimate the complexity of solving overdetermined sparse systems. Finally, our complexity results apply in the dense (usual) case and, as a surprising by-product, we prove that restrictive assumptions in usual complexity estimates of classical inhomogeneous Grobner bases algorithms can be removed.

Connected through hyperedge HE-1 (induced by source paper "gr o bner basis over semigroup algebras algorithms and applications for sparse polynomial systems"):
  with members:
    - "on the chordality of polynomial sets in triangular decomposition in top down style"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "polynomial systems solving by fast linear algebra"

Connected through hyperedge HE-2 (induced by source paper "on the chordality of polynomial sets in triangular decomposition in top down style"):
  with members:
    - "sparse fglm algorithms"
    - "chordal networks of polynomial ideals"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "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-3 (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"
    - "sparse fglm algorithms"
    - "chordal networks of polynomial ideals"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "a new algorithmic scheme for computing characteristic sets"

Connected through hyperedge HE-4 (induced by source paper "towards mixed grobner basis algorithms the multihomogeneous and sparse case"):
  with members:
    - "bilinear systems with two supports koszul resultant matrices eigenvalues and eigenvectors"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"

Connected through hyperedge HE-5 (induced by source paper "exploiting chordal structure in polynomial ideals a grobner bases approach"):
  with members:
    - "gr obner bases and nullstellens atze for graph coloring ideals"
    - "polynomial systems solving by fast linear algebra"

Connected through hyperedge HE-6 (induced by source paper "random sampling in computational algebra helly numbers and violator spaces"):
  with members:
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "gr obner bases and nullstellens atze for graph coloring ideals"
    - "polynomial systems solving by fast linear algebra"
    - "clarksons algorithm for violator spaces"
    - "violator spaces structure and algorithms"

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)