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: "model checking the higher dimensional modal mu calculus"
  Abstract: The higher-dimensional modal -calculus is an extension of the -calculus that has been introduced by Otto. The fascinating fea- ture of this extension is that it precisely characterizes the bisimulation- invariant polynomial-time properties over nite structures. In this paper we investigate how the model checking problem of the higher-dimensional modal -calculus can be eciently implemented. We propose two al- gorithms, based on extensions of local model checking and symbolic model checking algorithms respectively. We then illustrate the poten- tial strength of these generic algorithms for deciding specic problems of various elds, as process equivalences, automata theory, parsing, string problems, or games.

Connected through hyperedge HE-1 (induced by source paper "the arity hierarchy in the polyadic mu calculus"):
  with members:
    - "model checking process equivalences"

Connected through hyperedge HE-2 (induced by source paper "model checking process equivalences"):
  with members:
    - "the complexity of model checking higher order fixpoint logic"

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)