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: "convex language semantics for nondeterministic probabilistic automata"
  Abstract: We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that these automata are strictly more expressive than deterministic probabilistic automata, and we prove that the problem of checking language equivalence is undecidable by reduction from the threshold problem. However, we provide a discounted metric that can be computed to arbitrarily high precision.

Connected through hyperedge HE-1 (induced by source paper "non deterministic weighted automata evaluated over markov chains"):
  with members:
    - "quantitative automata under probabilistic semantics"
    - "percentile queries in multi dimensional markov decision processes"
    - "strategy synthesis for multi dimensional quantitative objectives"

Connected through hyperedge HE-2 (induced by source paper "the theory of traces for systems with nondeterminism and probability"):
  with members:
    - "trace and testing metrics on nondeterministic probabilistic processes"
    - "mixed powerdomains for probability and nondeterminism"
    - "the power of convex algebras"
    - "termination in convex sets of distributions"
    - "a convenient category for higher order probability theory"
    - "layer by layer combining monads"
    - "distribution based bisimulation for labelled markov processes"
    - "a storm is coming a modern probabilistic model checker"

Connected through hyperedge HE-3 (induced by source paper "graded monads and graded logics for the linear time branching time spectrum"):
  with members:
    - "coalgebraic trace semantics via forgetful logics"
    - "a linear time branching time spectrum of behavioral specification theories"
    - "automata theory in nominal sets"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "from branching to linear time coalgebraically"
    - "generalizing determinization from automata to coalgebras"
    - "generic trace logics"

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)