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: "a logical product approach to zonotope intersection"
  Abstract: We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, octagon, linear template or polyhedron domains While abstract transfer functions are still rather inexpensive and accurate even for interpreting non-linear computations, we are able to also interpret tests (i.e intersections) efficiently This fixes a known drawback of zonotopic methods, as used for reachability analysis for hybrid systems as well as for invariant generation in abstract interpretation: intersection of zonotopes are not always zonotopes, and there is not even a best zonotopic over-approximation of the intersection We describe some examples and an implementation of our method in the APRON library, and discuss some further interesting combinations of zonotopes with non-linear or non-convex domains such as quadratic templates and maxplus polyhedra.

Connected through hyperedge HE-1 (induced by source paper "automatic generation and verification of test stable floating point code"):
  with members:
    - "eliminating unstable tests in floating point programs"
    - "towards a compiler for reals"
    - "robustness analysis of finite precision implementations"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "relational abstract domains for the detection of floating point run time errors"

Connected through hyperedge HE-2 (induced by source paper "certified roundoff error bounds using semidefinite programming"):
  with members:
    - "nlcertify a tool for formal nonlinear optimization"
    - "formal proofs for nonlinear optimization"
    - "formal verification of nonlinear inequalities with taylor interval approximations"
    - "certification of bounds on expressions involving rounded operators"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-3 (induced by source paper "towards a compiler for reals"):
  with members:
    - "on the maximum relative error when computing x n in floating point arithmetic"
    - "robustness analysis of finite precision implementations"
    - "a non local method for robustness analysis of floating point programs"
    - "relational abstract domains for the detection of floating point run time errors"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "on numerical error propagation with sensitivity"):
  with members:
    - "robustness analysis of finite precision implementations"
    - "a non local method for robustness analysis of floating point programs"
    - "relational abstract domains for the detection of floating point run time errors"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "robustness analysis of finite precision implementations"):
  with members:
    - "a non local method for robustness analysis of floating point programs"
    - "a theory of robust software synthesis"
    - "a zonotopic framework for functional abstractions"
    - "perturbed affine arithmetic for invariant computation in numerical program analysis"

Connected through hyperedge HE-6 (induced by source paper "on sound compilation of reals"):
  with members:
    - "a semantics for approximate program transformations"
    - "relational abstract domains for the detection of floating point run time errors"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "a zonotopic framework for functional abstractions"):
  with members:
    - "robustness analysis of finite precision implementations"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "perturbed affine arithmetic for invariant computation in numerical program analysis"
    - "a new numerical abstract domain based on difference bound matrices"
    - "symbolic methods to enhance the precision of numerical abstract domains"

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)