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: "differential equation axiomatization the impressive power of differential ghosts"
  Abstract: We prove the completeness of an axiomatization for differential equation invariants. First, we show that the differential equation axioms in differential dynamic logic are complete for all algebraic invariants. Our proof exploits differential ghosts, which introduce additional variables that can be chosen to evolve freely along new differential equations. Cleverly chosen differential ghosts are the proof-theoretical counterpart of dark matter. They create new hypothetical state, whose relationship to the original state variables satisfies invariants that did not exist before. The reflection of these new invariants in the original system then enables its analysis.   We then show that extending the axiomatization with existence and uniqueness axioms makes it complete for all local progress properties, and further extension with a real induction axiom makes it complete for all real arithmetic invariants. This yields a parsimonious axiomatization, which serves as the logical foundation for reasoning about invariants of differential equations. Moreover, our results are purely axiomatic, and so the axiomatization is suitable for sound implementation in foundational theorem provers.

Connected through hyperedge HE-1 (induced by source paper "constructive hybrid games"):
  with members:
    - "constructive game logic"
    - "an axiomatic approach to liveness for differential equations"
    - "toward structured proofs for dynamic logics"
    - "uniform substitution for differential game logic"
    - "synthesis of strategies using the hoare logic of angelic and demonic nondeterminism"
    - "differential game logic"
    - "a uniform substitution calculus for differential dynamic logic"

Connected through hyperedge HE-2 (induced by source paper "relational differential dynamic logic"):
  with members:
    - "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 complete uniform substitution calculus for differential dynamic logic"
    - "a relational logic for higher order programs"

Connected through hyperedge HE-3 (induced by source paper "overview of logical foundations of cyber physical systems"):
  with members:
    - "uniform substitution in one fell swoop"
    - "verifiably safe off model reinforcement learning"
    - "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"
    - "formal verification of obstacle avoidance and navigation of ground robots"

Connected through hyperedge HE-4 (induced by source paper "an axiomatic approach to liveness for differential equations"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "differential hybrid games"
    - "computing semi algebraic invariants for polynomial dynamical systems"

Connected through hyperedge HE-5 (induced by source paper "towards physical hybrid systems"):
  with members:
    - "safe robust reachability analysis of hybrid systems"
    - "delta decidability over the reals"

Connected through hyperedge HE-6 (induced by source paper "parallel composition and modular verification of computer controlled systems in differential dynamic logic"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"

Connected through hyperedge HE-7 (induced by source paper "verified runtime validation for partially observable hybrid systems"):
  with members:
    - "soter programming safe robotics system using runtime assurance"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "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"

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)