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 game logic"
  Abstract: Differential game logic (dGL) is a logic for specifying and verifying properties of hybrid games, i.e., games that combine discrete, continuous, and adversarial dynamics. Unlike hybrid systems, hybrid games allow choices in the system dynamics to be resolved adversarially by different players with different objectives. The logic dGL can be used to study the existence of winning strategies for such hybrid games, i.e., ways of resolving the player’s choices in some way so that he wins by achieving his objective for all choices of the opponent. Hybrid games are determined, i.e., from each state, one player has a winning strategy, yet computing their winning regions may take transfinitely many steps. The logic dGL, nevertheless, has a sound and complete axiomatization relative to any expressive logic. Separating axioms are identified that distinguish hybrid games from hybrid systems. Finally, dGL is proved to be strictly more expressive than the corresponding logic of hybrid systems by characterizing the expressiveness of both.

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"
    - "a uniform substitution calculus for differential dynamic logic"

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

Connected through hyperedge HE-3 (induced by source paper "constructive game logic"):
  with members:
    - "synthesis of strategies using the hoare logic of angelic and demonic nondeterminism"
    - "towards a coalgebraic interpretation of propositional dynamic logic"

Connected through hyperedge HE-4 (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 hybrid games"

Connected through hyperedge HE-5 (induced by source paper "completeness for game logic"):
  with members:
    - "weak completeness of coalgebraic dynamic logics"
    - "exptime tableaux for the coalgebraic mu calculus"

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

Connected through hyperedge HE-7 (induced by source paper "a complete uniform substitution calculus for differential dynamic logic"):
  with members:
    - "differential hybrid games"
    - "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-8 (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"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"
    - "the structure of differential invariants and differential cut elimination"

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)