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: "satisfiability modulo odes"
  Abstract: We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software. We develop delta-complete algorithms for SMT formulas that are purely existentially quantified, as well as exists-forall formulas whose universal quantification is restricted to the time variables. We demonstrate scalability of the algorithms, as implemented in our open-source solver dReal, on SMT benchmarks with several hundred nonlinear ODEs and variables.

Connected through hyperedge HE-1 (induced by source paper "toward structured proofs for dynamic logics"):
  with members:
    - "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "sapo reachability computation and parameter synthesis of polynomial dynamical systems"
    - "a uniform substitution calculus for differential dynamic logic"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-2 (induced by source paper "representing hybrid automata by action language modulo theories"):
  with members:
    - "pddl planning via constraint answer set programming"
    - "modelling mixed discrete continuous domains for planning"

Connected through hyperedge HE-3 (induced by source paper "monitoring temporal properties using interval analysis"):
  with members:
    - "statistical model checking for stochastic hybrid systems"
    - "delta decidability over the reals"

Connected through hyperedge HE-4 (induced by source paper "monitoring bounded ltl properties using interval analysis"):
  with members:
    - "delta complete analysis for bounded reachability of hybrid systems"
    - "statistical model checking for stochastic hybrid systems"
    - "delta decidability over the reals"

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)