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 complete uniform substitution calculus for differential dynamic logic"
  Abstract: This article introduces a relatively complete proof calculus for differential dynamic logic (dL) that is entirely based on uniform substitution, a proof rule that substitutes a formula for a predicate symbol everywhere. Uniform substitutions make it possible to use axioms instead of axiom schemata, thereby substantially simplifying implementations. Instead of subtle schema variables and soundness-critical side conditions on the occurrence patterns of logical variables to restrict infinitely many axiom schema instances to sound ones, the resulting calculus adopts only a finite number of ordinary dLformulas as axioms, which uniform substitutions instantiate soundly. The static semantics of differential dynamic logic and the soundness-critical restrictions it imposes on proof steps is captured exclusively in uniform substitutions and variable renamings as opposed to being spread in delicate ways across the prover implementation. In addition to sound uniform substitutions, this article introduces differential forms for differential dynamic logic that make it possible to internalize differential invariants, differential substitutions, and derivatives as first-class axioms to reason about differential equations axiomatically. The resulting axiomatization of differential dynamic logic is proved to be sound and relatively complete.

Connected through hyperedge HE-1 (induced by source paper "verifiably safe off model reinforcement learning"):
  with members:
    - "logically correct reinforcement learning"
    - "verifying controllers against adversarial examples with bayesian optimization"
    - "shielded decision making in mdps"
    - "falsification of cyber physical systems using deep reinforcement learning"
    - "planning fast and slow a framework for adaptive real time safe trajectory planning"
    - "fastrack a modular framework for fast and guaranteed safe motion planning"
    - "constrained policy optimization"
    - "safe reinforcement learning via shielding"

Connected through hyperedge HE-2 (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"
    - "sapo reachability computation and parameter synthesis of polynomial dynamical systems"
    - "a uniform substitution calculus for differential dynamic logic"
    - "satisfiability modulo odes"
    - "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-3 (induced by source paper "relational differential dynamic logic"):
  with members:
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "probabilistic relational reasoning via metrics"
    - "ranking and repulsing supermartingales for reachability in probabilistic programs"
    - "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"
    - "a relational logic for higher order programs"

Connected through hyperedge HE-4 (induced by source paper "an axiomatic approach to liveness for differential equations"):
  with members:
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "differential hybrid games"
    - "computing semi algebraic invariants for polynomial dynamical systems"

Connected through hyperedge HE-5 (induced by source paper "uniform substitution in one fell swoop"):
  with members:
    - "uniform substitution for differential game logic"
    - "differential hybrid games"
    - "differential game logic"

Connected through hyperedge HE-6 (induced by source paper "parallel composition and modular verification of computer controlled systems in differential dynamic logic"):
  with members:
    - "differential equation axiomatization the impressive power of differential ghosts"

Connected through hyperedge HE-7 (induced by source paper "verified runtime validation for partially observable hybrid systems"):
  with members:
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "soter programming safe robotics system using runtime assurance"
    - "fastrack a modular framework for fast and guaranteed safe motion planning"
    - "formal verification of obstacle avoidance and navigation of ground robots"
    - "robust online monitoring of signal temporal logic"
    - "on line monitoring for temporal logic robustness"
    - "counter strategy guided refinement of gr 1 temporal logic specifications"

Connected through hyperedge HE-8 (induced by source paper "hybrid temporal situation calculus"):
  with members:
    - "bounded situation calculus action theories"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"
    - "essential convexity and complexity of semi algebraic constraints"
    - "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)