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: "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
  Abstract: We introduce a new domain for finding precise numerical invariants of programs by abstract interpretation. This domain, which consists of level sets of non-linear functions, generalizes the domain of linear "templates" introduced by Manna, Sankaranarayanan, and Sipma. In the case of quadratic templates, we use Shor's semi-definite relaxation to derive computable yet precise abstractions of semantic functionals, and we show that the abstract fixpoint equation can be solved accurately by coupling policy iteration and semi-definite programming. We demonstrate the interest of our approach on a series of examples (filters, integration schemes) including a degenerate one (symplectic scheme).

Connected through hyperedge HE-1 (induced by source paper "synthesizing invariants by solving solvable loops"):
  with members:
    - "polynomial invariants by linear algebra"
    - "using dynamic analysis to generate disjunctive invariants"
    - "abstract acceleration of general linear loops"

Connected through hyperedge HE-2 (induced by source paper "property based polynomial invariant generation using sums of squares optimization"):
  with members:
    - "a sums of squares extension of policy iterations"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"
    - "exact safety verification of hybrid systems using sums of squares representation"

Connected through hyperedge HE-3 (induced by source paper "a sums of squares extension of policy iterations"):
  with members:
    - "property based polynomial invariant generation using sums of squares optimization"
    - "technical report convex optimization of nonlinear feedback controllers via occupation measures"

Connected through hyperedge HE-4 (induced by source paper "polynomial template generation using sum of squares programming"):
  with members:
    - "certification of bounds of non linear functions the templates method"
    - "exact safety verification of hybrid systems using sums of squares representation"

Connected through hyperedge HE-5 (induced by source paper "certification of bounds of non linear functions the templates method"):
  with members:
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"
    - "delta complete decision procedures for satisfiability over the reals"

Connected through hyperedge HE-6 (induced by source paper "numerical invariants through convex relaxation and max strategy iteration"):
  with members:
    - "exponential lower bounds for policy iteration"
    - "using ellipsoidal domains to analyze control systems software"
    - "a new numerical abstract domain based on difference bound matrices"
    - "the octagon abstract domain"

Connected through hyperedge HE-7 (induced by source paper "improving strategies via smt solving"):
  with members:
    - "a quantifier elimination algorithm for linear real arithmetic"
    - "automatic modular abstractions for linear constraints"
    - "a new numerical abstract domain based on difference bound matrices"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-8 (induced by source paper "a logical product approach to zonotope intersection"):
  with members:
    - "a zonotopic framework for functional abstractions"
    - "perturbed affine arithmetic for invariant computation in numerical program analysis"
    - "a new numerical abstract domain based on difference bound 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.LO(Logic in Computer Science)