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: "fair simulation for nondeterministic and probabilistic buechi automata a coalgebraic perspective"
  Abstract: Notions of simulation, among other uses, provide a computationally tractable#N#and sound (but not necessarily complete) proof method for language inclusion.#N#They have been comprehensively studied by Lynch and Vaandrager for#N#nondeterministic and timed systems; for B\"{u}chi automata the notion of fair#N#simulation has been introduced by Henzinger, Kupferman and Rajamani. We#N#contribute to a generalization of fair simulation in two different directions:#N#one for nondeterministic tree automata previously studied by Bomhard; and the#N#other for probabilistic word automata with finite state spaces, both under the#N#B\"{u}chi acceptance condition. The former nondeterministic definition is#N#formulated in terms of systems of fixed-point equations, hence is readily#N#translated to parity games and is then amenable to Jurdzi\'{n}ski's algorithm;#N#the latter probabilistic definition bears a strong ranking-function flavor.#N#These two different-looking definitions are derived from one source, namely our#N#coalgebraic modeling of B\"{u}chi automata. Based on these coalgebraic#N#observations, we also prove their soundness: a simulation indeed witnesses#N#language inclusion.

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)