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 "on the number of gapped repeats with arbitrary gap"):
  Abstract: For any functions $f(x)$, $g(x)$ from $\mathbb {N}$ to $\mathbb {R}$ we call repeats $uvu$ such that $g(|u|)\le |v|\le f(|u|)$ as {\it $f,g$-gapped repeats}. We study the possible number of $f,g$-gapped repeats in words of fixed length~$n$. For quite weak conditions on $f(x)$, $g(x)$ we obtain an upper bound on this number which is linear to~$n$.

Includes members:
  Member "the runs theorem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "efficiently finding all maximal alpha gapped repeats":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "searching of gapped repeats and subrepetitions in a word")
  Member "longest gapped repeats and palindromes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient computation of longest single arm gapped palindromes in a string")
  Member "searching of gapped repeats and subrepetitions in a word":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "matching patterns with variables")
  Member "on primary and secondary repetitions in words":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal searching of gapped repeats in a word")
  Member "on the maximal sum of exponents of runs in a string":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the runs theorem")

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)