human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "an extension of parikh s theorem beyond idempotence"):
  Abstract: The commutative ambiguity cambG,X of a context-free grammar G with start symbol X assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton’s method to !-continuous semirings [EKL07b, EKL07a, EKL10], we show how to approximate cambG,X by means of rational formal power series, and give a lower bound on the convergence speed of these approximations. From the latter result we deduce that cambG,X itself is rational modulo the generalized idempotence identity k = k + 1 (for k some positive integer), and, subsequently, that it can be represented as a weighted sum of linear sets. This extends Parikh’s well-known result that the commutative image of context-free languages is semilinear (k = 1). Based on the well-known relationship between context-free grammars and algebraic systems over semirings [CS63, SS78, BR82, Kui97, Boz99], our results extend the work by Green et al. [GKT07] on the computation of the provenance of Datalog queries over commutative !-continuous semirings.

Includes members:
  Member "parikh s theorem a simple and direct automaton construction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "re pairing brackets")
  Member "space efficient scheduling of stochastically generated tasks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of probabilistic basic parallel processes")

Question: Please tell me which class the source paper 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)