human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "explaining non bisimilarity in a coalgebraic approach games and distinguishing formulas"):
  Abstract: Behavioural equivalences can be characterized via bisimulation, modal logics, and spoiler-duplicator games. In this paper we work in the general setting of coalgebra and focus on generic algorithms for computing the winning strategies of both players in a bisimulation game. The winning strategy of the spoiler (if it exists) is then transformed into a modal formula that distinguishes the given non-bisimilar states. The modalities required for the formula are also synthesized on-the-fly, and we present a recipe for re-coding the formula with different modalities, given a separating set of predicate liftings. Both the game and the generation of the distinguishing formulas have been implemented in a tool called T-BEG.

Includes members:
  Member "codensity games for bisimilarity":
    also connected through other hyperedges:
      (none)
  Member "predicate liftings and functor presentations in coalgebraic expression languages":
    also connected through other hyperedges:
      (none)
  Member "efficient coalgebraic partition refinement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automata learning an algebraic approach")
  Member "games for bisimulations and abstraction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truly concurrent bisimilarities are game equivalent")
  Member "metric bisimulation games and real valued modal logics for coalgebras":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing probabilistic bisimilarity distances for probabilistic automata")
  Member "simulations and bisimulations for coalgebraic modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "model comparison games for horn description logics")

Question: Please tell me which class the source paper 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)