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 quantifier elimination algorithm for linear real arithmetic"
  Abstract: We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems, to several other implementations, all of which cannot solve some of the examples that our algorithm solves easily.

Connected through hyperedge HE-1 (induced by source paper "loop summarization with rational vector addition systems extended version"):
  with members:
    - "invariant generation for multi path loops with polynomial assignments"
    - "polynomial invariants for affine programs"
    - "approaching the coverability problem continuously"
    - "integer vector addition systems with states"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"

Connected through hyperedge HE-2 (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"
    - "generating non linear interpolants by semidefinite programming"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a simple abstraction of arrays and maps by program translation"):
  with members:
    - "definability of accelerated relations in a theory of arrays and its applications"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "generating property directed potential invariants by backward analysis"):
  with members:
    - "pkind a parallel k induction based model checker"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "a hybrid approach for synthesizing optimal controllers of hybrid systems a case study of the oil pump industrial example"):
  with members:
    - "computing semi algebraic invariants for polynomial dynamical systems"

Connected through hyperedge HE-6 (induced by source paper "improving strategies via smt solving"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "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-7 (induced by source paper "automatic modular abstractions for template numerical constraints"):
  with members:
    - "the pitfalls of verifying floating point computations"
    - "automatic modular abstractions for linear constraints"
    - "relational abstract domains for the detection of floating point run time errors"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-8 (induced by source paper "automatic modular abstractions for linear constraints"):
  with members:
    - "the pitfalls of verifying floating point computations"
    - "relational abstract domains for the detection of floating point run time errors"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

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)