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: "an automaton over data words that captures emso logic"
  Abstract: We develop a general framework for the specification and implementation of systems whose executions are words, or partial orders, over an infinite alphabet. As a model of an implementation, we introduce class register automata, a one-way automata model over words with multiple data values. Our model combines register automata and class memory automata. It has natural interpretations. In particular, it captures communicating automata with an unbounded number of processes, whose semantics can be described as a set of (dynamic) message sequence charts. On the specification side, we provide a local existential monadic second-order logic that does not impose any restriction on the number of variables. We study the realizability problem and show that every formula from that logic can be effectively, and in elementary time, translated into an equivalent class register automaton.

Connected through hyperedge HE-1 (induced by source paper "reasoning about data repetitions with counter systems"):
  with members:
    - "demystifying reachability in vector addition systems"
    - "ordered navigation on multi attributed data words"
    - "an extension of data automata that captures xpath"
    - "feasible automata for two variable logic with successor on data words"
    - "temporal logics on words with multiple data values"
    - "ltl with the freeze quantifier and register automata"
    - "temporal logic with predicate abstraction"

Connected through hyperedge HE-2 (induced by source paper "on the expressiveness of tptl and mtl over ω data words"):
  with members:
    - "on expressive powers of timed logics comparing boundedness non punctuality and deterministic freezing"
    - "ltl with the freeze quantifier and register automata"
    - "on the freeze quantifier in constraint ltl decidability and complexity"

Connected through hyperedge HE-3 (induced by source paper "a decidable class of nominal omega regular languages over an infinite alphabet"):
  with members:
    - "feasible automata for two variable logic with successor on data words"
    - "extending buchi automata with constraints on data values"
    - "safety alternating automata on data words"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-4 (induced by source paper "ehrenfeucht fraisse games for tptl and mtl over non monotonic data words"):
  with members:
    - "on expressive powers of timed logics comparing boundedness non punctuality and deterministic freezing"

Connected through hyperedge HE-5 (induced by source paper "feasible automata for two variable logic with successor on data words"):
  with members:
    - "a decidable extension of data automata"
    - "safety alternating automata on data words"
    - "ltl with the freeze quantifier and register automata"

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)