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 hybrid games"
  Abstract: This article introduces differential hybrid games, which combine differential games with hybrid games. In both kinds of games, two players interact with continuous dynamics. The difference is that hybrid games also provide all the features of hybrid systems and discrete games, but only deterministic differential equations. Differential games, instead, provide differential equations with continuous-time game input by both players, but not the luxury of hybrid games, such as mode switches and discrete-time or alternating adversarial interaction. This article augments differential game logic with modalities for the combined dynamics of differential hybrid games. It shows how hybrid games subsume differential games and introduces differential game invariants and differential game variants for proving properties of differential games inductively.

Connected through hyperedge HE-1 (induced by source paper "refining constructive hybrid games"):
  with members:
    - "constructive game logic"
    - "differential game logic"

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

Connected through hyperedge HE-3 (induced by source paper "uniform substitution in one fell swoop"):
  with members:
    - "uniform substitution for differential game logic"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "differential game logic"

Connected through hyperedge HE-4 (induced by source paper "uniform substitution for differential game logic"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "differential game logic"

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