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: "fly automata model checking and recognizability"
  Abstract: The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the considered graphs. This theorem entails that the verification of MSO graph properties, or equivalently, the model-checking problem for MSO logic over finite binary relational structures, is fixed-parameter tractable (FPT) for the parameter consisting of the formula that expresses the property and the clique-width (or the tree-width) of the input graph or structure. The corresponding algorithms can be implemented by means of fly-automata whose transitions are computed on the fly and not tabulated. We review two versions of recognizability, we present fly-automata by means of examples showing that they can also compute values attached to graphs. We show that fly-automata with infinite sets of states yield a simple proof of the strong version of the Recognizability Theorem. This proof has not been published previously.

Connected through hyperedge HE-1 (induced by source paper "fly automata for checking mso 2 graph properties"):
  with members:
    - "computations by fly automata beyond monadic second order logic"
    - "courcelle s theorem a game theoretic approach"

Connected through hyperedge HE-2 (induced by source paper "computations by fly automata beyond monadic second order logic"):
  with members:
    - "the rank width of edge coloured graphs"
    - "expansions of mso by cardinality relations"
    - "courcelle s theorem a game theoretic approach"
    - "algorithmic meta theorems"

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)