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: "graph logics with rational relations"
  Abstract: We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword or subsequence. Evaluating formulae in such extended graph logics boils down to checking nonemptiness of the intersection of rational relations with regular or recognizable relations (or, more generally, to the generalized intersection problem, asking whether some projections of a regular relation have a nonempty intersection with a given rational relation). #R##N#We prove that for several basic and commonly used rational relations, the intersection problem with regular relations is either undecidable (e.g., for subword or suffix, and some generalizations), or decidable with non-primitive-recursive complexity (e.g., for subsequence and its generalizations). These results are used to rule out many classes of graph logics that freely combine regular and rational relations, as well as to provide the simplest problem related to verifying lossy channel systems that has non-primitive-recursive complexity. We then prove a dichotomy result for logics combining regular conditions on individual paths and rational relations on paths, by showing that the syntactic form of formulae classifies them into either efficiently checkable or undecidable cases. We also give examples of rational relations for which such logics are decidable even without syntactic restrictions.

Connected through hyperedge HE-1 (induced by source paper "decision procedures for path feasibility of string manipulating programs with complex operations"):
  with members:
    - "what is decidable about string constraints with the replaceall function"
    - "recompression a simple and powerful technique for word equations"
    - "the complexity of games on higher order pushdown automata"

Connected through hyperedge HE-2 (induced by source paper "complexity hierarchies beyond elementary"):
  with members:
    - "relating timed and register automata"
    - "demystifying reachability in vector addition systems"
    - "nonelementary complexities for branching vass mell and extensions"
    - "on freeze ltl with ordered attributes"
    - "trace inclusion for one counter nets revisited"
    - "the power of priority channel systems"
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "senescent ground tree rewrite systems"

Connected through hyperedge HE-3 (induced by source paper "on reachability for unidirectional channel systems extended with regular tests"):
  with members:
    - "complexity hierarchies beyond elementary"
    - "generalized post embedding problems"
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "the power of well structured systems"
    - "reachability analysis of communicating pushdown systems"
    - "cutting through regular post embedding problems"
    - "reachability of communicating timed processes"
    - "multiply recursive upper bounds with higman s lemma"

Connected through hyperedge HE-4 (induced by source paper "generalized post embedding problems"):
  with members:
    - "complexity hierarchies beyond elementary"
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "cutting through regular post embedding problems"
    - "multiply recursive upper bounds with higman s lemma"
    - "alternating timed automata"

Connected through hyperedge HE-5 (induced by source paper "string solving with word equations and transducers towards a logic for analysing mutation xss full version"):
  with members:
    - "parikh s theorem a simple and direct automaton construction"
    - "algorithmic metatheorems for decidable ltl model checking over infinite systems"
    - "symbolic model checking of tense logics on rational kripke models"

Connected through hyperedge HE-6 (induced by source paper "notions of bidirectional computation and entangled state monads"):
  with members:
    - "handling algebraic effects"

Connected through hyperedge HE-7 (induced by source paper "automata techniques for epistemic protocol synthesis"):
  with members:
    - "the complexity of synthesizing uniform strategies"

Connected through hyperedge HE-8 (induced by source paper "the power of well structured systems"):
  with members:
    - "complexity hierarchies beyond elementary"
    - "the power of priority channel systems"
    - "parameterized verification of asynchronous shared memory systems"
    - "forward analysis for wsts part ii complete wsts"
    - "alternating register automata on finite words and trees"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "multiply recursive upper bounds with higman s lemma"
    - "alternating automata on data trees and xpath satisfiability"

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.FL(Formal Languages and Automata Theory)