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: "bisimulation games on coalgebras"
  Abstract: In the theory of transition systems it is of great interest to determine whether two given states are bisimilar. Transition systems can be modelled as coalgebras, which gives us a general framework to analyse behavioural equivalence of systems with various branching types. In classical bisimulation theory, the concept of attacker-defender games provides us with an alternative way to define bisimulation. In such games the attacker tries to make a move that cannot be imitated by the defender. If the defender is always able to match the move of the attacker, we can infer that both initial states are behaviourally equivalent. Viewing behavioural equivalence as a game is quite intuitive and also has a clear relation to modal logics. To our knowledge, there has been only little work on generalizing such bisimulation games to the level of coalgebra. In this paper, we are proposing games for coalgebras in Set and show that they faithfully characterize behavioural equivalence. We require a condition on functors which already appeared similarly in work on coalgebraic modal logics.

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)