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: "decidability of timed communicating automata"
  Abstract: We study the reachability problem for networks of timed communicating processes. Each process is a timed automaton communicating with other processes by exchanging messages over unbounded FIFO channels. Messages carry clocks which are checked at the time of transmission and reception with suitable timing constraints. Each automaton can only access its set of local clocks and message clocks of sent/received messages. Time is dense and all clocks evolve at the same rate. Our main contribution is a complete characterisation of decidable and undecidable communication topologies generalising and unifying previous work. From a technical point of view, we use quantifier elimination and a reduction to counter automata with registers.

Connected through hyperedge HE-1 (induced by source paper "timed basic parallel processes"):
  with members:
    - "effective definability of the reachability relation in timed automata"
    - "universal safety for timed petri nets is pspace complete"
    - "reachability in two clock timed automata is pspace complete"
    - "a faster algorithm for solving one clock priced timed games"
    - "reachability analysis of communicating pushdown systems"
    - "reachability of communicating timed processes"
    - "reachability time games on timed automata"
    - "alternating timed automata"

Connected through hyperedge HE-2 (induced by source paper "timed systems through the lens of logic"):
  with members:
    - "non sequential theory of distributed systems"
    - "binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms"
    - "towards an efficient tree automata based technique for timed systems"
    - "analyzing timed systems using tree automata"
    - "timed pushdown automata revisited"
    - "monadic second order definable graph orderings"
    - "quantified ctl expressiveness and complexity"

Connected through hyperedge HE-3 (induced by source paper "binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms"):
  with members:
    - "timed pushdown automata revisited"

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)