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: "the structure of differential invariants and differential cut elimination"
  Abstract: The biggest challenge in hybrid systems verification is the handling of#N#differential equations. Because computable closed-form solutions only exist for#N#very simple differential equations, proof certificates have been proposed for#N#more scalable verification. Search procedures for these proof certificates are#N#still rather ad-hoc, though, because the problem structure is only understood#N#poorly. We investigate differential invariants, which define an induction#N#principle for differential equations and which can be checked for invariance#N#along a differential equation just by using their differential structure,#N#without having to solve them. We study the structural properties of#N#differential invariants. To analyze trade-offs for proof search complexity, we#N#identify more than a dozen relations between several classes of differential#N#invariants and compare their deductive power. As our main results, we analyze#N#the deductive power of differential cuts and the deductive power of#N#differential invariants with auxiliary differential variables. We refute the#N#differential cut elimination hypothesis and show that, unlike standard cuts,#N#differential cuts are fundamental proof principles that strictly increase the#N#deductive power. We also prove that the deductive power increases further when#N#adding auxiliary differential variables to the dynamics.

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"
    - "satisfiability modulo odes"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"

Connected through hyperedge HE-2 (induced by source paper "predicate transformer semantics for hybrid systems verification components for isabelle hol"):
  with members:
    - "a recipe for state and effect triangles"
    - "on the expressive power of kleene algebra with domain"
    - "kleene algebra with domain"

Connected through hyperedge HE-3 (induced by source paper "differential equation axiomatization the impressive power of differential ghosts"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "computing semi algebraic invariants for polynomial dynamical systems"

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

Connected through hyperedge HE-5 (induced by source paper "complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial ode s"):
  with members:
    - "algebra coalgebra and minimization in polynomial differential equations"
    - "essential convexity and complexity of semi algebraic constraints"
    - "computing semi algebraic invariants for polynomial dynamical systems"

Connected through hyperedge HE-6 (induced by source paper "formal verification of obstacle avoidance and navigation of ground robots"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "differential game logic"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"

Connected through hyperedge HE-7 (induced by source paper "differential hybrid games"):
  with members:
    - "differential game logic"
    - "o minimal hybrid reachability games"

Connected through hyperedge HE-8 (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"
    - "a uniform substitution calculus for differential dynamic logic"

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)