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: "multihomogeneous resultant formulae for systems with scaled support"
  Abstract: Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equals the resultant and characterize the systems that admit such formulae. Bezout-type determinantal formulae do not exist, but we describe all possible Sylvester-type and hybrid formulae. We establish tight bounds for all corresponding degree vectors, and specify domains that will surely contain such vectors; the latter are new even for the unmixed case. Second, we make use of multiplication tables and strong duality theory to specify resultant matrices explicitly, for a general scaled system, thus including unmixed systems. The encountered matrices are classified; these include a new type of Sylvester-type matrix as well as Bezout-type matrices, known as partial Bezoutians. Our public-domain Maple implementation includes efficient storage of complexes in memory, and construction of resultant matrices.

Connected through hyperedge HE-1 (induced by source paper "bilinear systems with two supports koszul resultant matrices eigenvalues and eigenvectors"):
  with members:
    - "towards mixed grobner basis algorithms the multihomogeneous and sparse case"

Connected through hyperedge HE-2 (induced by source paper "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"):
  with members:
    - "solving rank constrained semidefinite programs in exact arithmetic"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "powers of tensors and fast matrix multiplication"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "on the complexity of the multivariate resultant"
    - "intrinsic complexity estimates in polynomial optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"

Connected through hyperedge HE-3 (induced by source paper "compact formulae in sparse elimination"):
  with members:
    - "an oracle based output sensitive algorithm for projections of resultant polytopes"

Connected through hyperedge HE-4 (induced by source paper "chapter 10 algebraic algorithms"):
  with members:
    - "matrix methods for solving algebraic systems"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "the dmm bound multivariate aggregate separation bounds"
    - "random polynomials and expected complexity of bisection methods for real solving"
    - "improved complexity bounds for real root isolation using continued fractions"
    - "stable normal forms for polynomial system solving"
    - "faster inversion and other black box matrix computations using efficient block projections"
    - "smoothed analysis of the condition numbers and growth factors of matrices"

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)