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 uniform substitution calculus for differential dynamic logic"
  Abstract: This paper introduces a new proof calculus for differential dynamic logic (\(\mathsf {d}\mathcal {L}\)) 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 rely on axioms rather than axiom schemata, substantially simplifying implementations. Instead of subtle schema variables and soundness-critical side conditions on the occurrence patterns of variables, the resulting calculus adopts only a finite number of ordinary \(\mathsf {d}\mathcal {L}\) formulas as axioms. The static semantics of differential dynamic logic is captured exclusively in uniform substitutions and bound variable renamings as opposed to being spread in delicate ways across the prover implementation. In addition to sound uniform substitutions, this paper introduces differential forms for differential dynamic logic that make it possible to internalize differential invariants, differential substitutions, and derivations as first-class axioms in \(\mathsf {d}\mathcal {L}\).

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"
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "uniform substitution for differential game logic"
    - "synthesis of strategies using the hoare logic of angelic and demonic nondeterminism"
    - "differential game logic"

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"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "sapo reachability computation and parameter synthesis of polynomial dynamical systems"
    - "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 "a survey on analog models of computation"):
  with members:
    - "real time computability of real numbers by chemical reaction networks"
    - "robustness of expressivity in chemical reaction networks"
    - "efficient analog circuits for boolean satisfiability"
    - "axiomatizing analog algorithms"
    - "homonym population protocols"
    - "physical computation p poly and p log"
    - "on recurrent reachability for continuous linear dynamical systems"
    - "learning to transduce with unbounded memory"

Connected through hyperedge HE-4 (induced by source paper "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "autoproof auto active functional verification of object oriented programs"
    - "the dafny integrated development environment"
    - "isabelle jedit a prover ide within the pide framework"
    - "understanding the learners actions when using mathematics learning tools"

Connected through hyperedge HE-5 (induced by source paper "a complete uniform substitution calculus for differential dynamic logic"):
  with members:
    - "differential hybrid games"
    - "differential game logic"
    - "essential convexity and complexity of semi algebraic constraints"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-6 (induced by source paper "safety certified cooperative adaptive cruise control under unreliable inter vehicle communications"):
  with members:
    - "the complexity of cylindrical algebraic decomposition with respect to polynomial degree"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-7 (induced by source paper "differential game logic"):
  with members:
    - "differential hybrid games"
    - "the structure of differential invariants and differential cut elimination"
    - "o minimal hybrid reachability games"
    - "timed parity games complexity and robustness"
    - "on the expressiveness and complexity of atl"

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)