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: "on the probability of being synchronizable"
  Abstract: We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability. Moreover, we also prove that the convergence rate is exactly $1-\Theta(\frac{1}{n})$ as conjectured by Cameron \cite{CamConj} for the most interesting binary alphabet case. Finally, we describe a deterministic algorithm which decides whether a given random automaton is synchronizing in linear expected time.

Connected through hyperedge HE-1 (induced by source paper "optimal synchronization of partial deterministic finite automata"):
  with members:
    - "lower bounds for synchronizing word lengths in partial automata"
    - "fast synchronization of random automata"
    - "primitive digraphs with large exponents and slowly synchronizing automata"
    - "generating shortest synchronizing sequences using answer set programming"
    - "on two algorithmic problems about synchronizing automata"

Connected through hyperedge HE-2 (induced by source paper "on random primitive sets directable ndfas and the generation of slowly synchronizing dfas"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "on the interplay between babai and v c ern y s conjectures"
    - "an extremal series of eulerian synchronizing automata"
    - "primitive digraphs with large exponents and slowly synchronizing automata"

Connected through hyperedge HE-3 (induced by source paper "synchronizing random almost group automata"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "fast synchronization of random automata"
    - "the road coloring problem"

Connected through hyperedge HE-4 (induced by source paper "extending word problems in deterministic finite automata"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "completely reachable automata"
    - "synchronizing automata with extremal properties"
    - "subset synchronization of transitive automata"
    - "a note on a recent attempt to improve the pin frankl bound"
    - "strong inapproximability of the shortest reset word"
    - "on two algorithmic problems about synchronizing automata"
    - "modifying the upper bound on the length of minimal synchronizing word"

Connected through hyperedge HE-5 (induced by source paper "implementation of the algorithm for testing an automaton for synchronization in linear expected time"):
  with members:
    - "on two algorithmic problems about synchronizing automata"

Connected through hyperedge HE-6 (induced by source paper "the complexity of synchronizing markov decision processes"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "controlling a population"
    - "synchronizing data words for register automata"
    - "computation tree logic for synchronization properties"
    - "trace refinement in labelled markov decision processes"
    - "synchronizing weighted automata"
    - "probabilistic bisimulation naturally on distributions"
    - "fast synchronization of random automata"

Connected through hyperedge HE-7 (induced by source paper "on the number of synchronizing colorings of digraphs"):
  with members:
    - "complexity of road coloring with prescribed reset words"
    - "reset thresholds of automata with two cycle lengths"
    - "fast synchronization of random automata"
    - "synchronizing automata with large reset lengths"
    - "primitive digraphs with large exponents and slowly synchronizing automata"
    - "practical graph isomorphism ii"
    - "a quadratic algorithm for road coloring"
    - "the road coloring problem"

Connected through hyperedge HE-8 (induced by source paper "algebraic synchronization criterion and computing reset words"):
  with members:
    - "experiments with synchronizing automata"
    - "fast synchronization of random automata"
    - "synchronizing automata with large reset lengths"
    - "strong inapproximability of the shortest reset word"
    - "primitive digraphs with large exponents and slowly synchronizing automata"
    - "on the probability to be synchronizable"
    - "on two algorithmic problems about synchronizing automata"
    - "independent sets of words and the synchronization problem"

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)