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: "chordal networks of polynomial ideals"
  Abstract: We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables. Chordal networks provide a computationally convenient decomposition into simpler (triangular) polynomial sets, while preserving the underlying graphical structure. We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components is exponentially large. Chordal networks can be computed for arbitrary polynomial systems using a refinement of the chordal elimination algorithm from [D. Cifuentes and P. A. Parrilo, SIAM J. Discrete Math., 30 (2016), pp. 1534--1570]. Furthermore, they can be effectively used to obtain several properties of the variety, such as its dimension, cardinality, and equidimensional components, as well as an efficient probabilistic tes...

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

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)