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: "generating non linear interpolants by semidefinite programming"
  Abstract: Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model check- ing, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, little work focuses on discovering polynomial interpolants in the literature. In this paper, we provide an approach for constructing non-linear interpolants based on semidefinite programming, and show how to apply such results to the verification of programs by examples.

Connected through hyperedge HE-1 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "polynomial invariants for affine programs"
    - "abstraction of elementary hybrid systems by variable transformation"
    - "julia a fresh approach to numerical computing"
    - "predicate generation for learning based quantifier free loop invariant inference"

Connected through hyperedge HE-2 (induced by source paper "nil learning nonlinear interpolants"):
  with members:
    - "sharper and simpler nonlinear interpolants for program verification"
    - "on interpolation and symbol elimination in theory extensions"
    - "interpolation synthesis for quadratic polynomial inequalities and combination with euf"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-3 (induced by source paper "nonlinear craig interpolant generation"):
  with members:
    - "a hybrid approach for synthesizing optimal controllers of hybrid systems a case study of the oil pump industrial example"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-4 (induced by source paper "finding polynomial loop invariants for probabilistic programs"):
  with members:
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"
    - "on the hardness of almost sure termination"
    - "proving inequalities and solving global optimization problems via simplified cad projection"

Connected through hyperedge HE-5 (induced by source paper "sharper and simpler nonlinear interpolants for program verification"):
  with members:
    - "interpolation synthesis for quadratic polynomial inequalities and combination with euf"
    - "interpolation properties and sat based model checking"
    - "barrier certificates revisited"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-6 (induced by source paper "a survey of satisfiability modulo theory"):
  with members:
    - "proof tree preserving interpolation"
    - "how to compute worst case execution time by optimization modulo theory and a clever encoding of program semantics"
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "pagai a path sensitive static analyzer"
    - "succinct representations for abstract interpretation"
    - "optimization in smt with la q cost functions"
    - "on using floating point computations to help an exact linear arithmetic decision procedure"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-7 (induced by source paper "generalized homogeneous polynomials for efficient template based nonlinear invariant synthesis"):
  with members:
    - "sharper and simpler nonlinear interpolants for program verification"
    - "property based polynomial invariant generation using sums of squares optimization"

Connected through hyperedge HE-8 (induced by source paper "barrier certificates revisited"):
  with members:
    - "abstraction of elementary hybrid systems by variable transformation"
    - "exponential condition based barrier certificate generation for safety verification of hybrid systems"
    - "proving inequalities and solving global optimization problems via simplified cad projection"
    - "computing semi algebraic invariants for polynomial dynamical systems"
    - "exact safety verification of hybrid systems using sums of squares representation"

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.LO(Logic in Computer Science)