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: "enriched mu calculi module checking"
  Abstract: The model checking problem for open systems has been intensively studied in#N#the literature, for both finite-state (module checking) and infinite-state#N#(pushdown module checking) systems, with respect to Ctl and Ctl*. In this#N#paper, we further investigate this problem with respect to the \mu-calculus#N#enriched with nominals and graded modalities (hybrid graded Mu-calculus), in#N#both the finite-state and infinite-state settings. Using an automata-theoretic#N#approach, we show that hybrid graded \mu-calculus module checking is solvable#N#in exponential time, while hybrid graded \mu-calculus pushdown module checking#N#is solvable in double-exponential time. These results are also tight since they#N#match the known lower bounds for Ctl. We also investigate the module checking#N#problem with respect to the hybrid graded \mu-calculus enriched with inverse#N#programs (Fully enriched \mu-calculus): by showing a reduction from the domino#N#problem, we show its undecidability. We conclude with a short overview of the#N#model checking problem for the Fully enriched Mu-calculus and the fragments#N#obtained by dropping at least one of the additional constructs.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of atl and atl module checking"):
  with members:
    - "quantified ctl expressiveness and complexity"
    - "reasoning about strategies on the model checking problem"
    - "new results on pushdown module checking with imperfect information"

Connected through hyperedge HE-2 (induced by source paper "extended graded modalities in strategy logic"):
  with members:
    - "mcmas slk a model checker for the verification of strategy logic specifications"
    - "global numerical constraints on trees"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-3 (induced by source paper "cycle detection in computation tree logic"):
  with members:
    - "reasoning about strategies on the satisfiability problem"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-4 (induced by source paper "state of buchi complementation"):
  with members:
    - "buchi complementation and size change termination"
    - "b uchi complementation made tight"
    - "antichains for the automata based approach to model checking"
    - "lower bounds for complementation of omega automata via the full automata technique"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"
    - "decisive markov chains"

Connected through hyperedge HE-5 (induced by source paper "global numerical constraints on trees"):
  with members:
    - "node selection query languages for trees"
    - "decidable classes of tree automata mixing local and global constraints modulo flat theories"

Connected through hyperedge HE-6 (induced by source paper "reasoning about strategies on the model checking problem"):
  with members:
    - "mcmas slk a model checker for the verification of strategy logic specifications"
    - "reasoning about knowledge and strategies epistemic strategy logic"
    - "satisfiability of atl with strategy contexts"
    - "doomsday equilibria for omega regular games"
    - "towards an updatable strategy logic"
    - "a decidable fragment of strategy logic"
    - "the complexity of enriched mu calculi"

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)