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 "searching of gapped repeats and subrepetitions in a word"):
  Abstract: A gapped repeat is a factor of the form $uvu$ where $u$ and $v$ are nonempty words. The period of the gapped repeat is defined as $|u|+|v|$. The gapped repeat is maximal if it cannot be extended to the left or to the right by at least one letter with preserving its period. The gapped repeat is called $\alpha$-gapped if its period is not greater than $\alpha |v|$. A $\delta$-subrepetition is a factor which exponent is less than 2 but is not less than $1+\delta$ (the exponent of the factor is the quotient of the length and the minimal period of the factor). The $\delta$-subrepetition is maximal if it cannot be extended to the left or to the right by at least one letter with preserving its minimal period. We reveal a close relation between maximal gapped repeats and maximal subrepetitions. Moreover, we show that in a word of length $n$ the number of maximal $\alpha$-gapped repeats is bounded by $O(\alpha^2n)$ and the number of maximal $\delta$-subrepetitions is bounded by $O(n/\delta^2)$. Using the obtained upper bounds, we propose algorithms for finding all maximal $\alpha$-gapped repeats and all maximal $\delta$-subrepetitions in a word of length $n$. The algorithm for finding all maximal $\alpha$-gapped repeats has $O(\alpha^2n)$ time complexity for the case of constant alphabet size and $O(n\log n + \alpha^2n)$ time complexity for the general case. For finding all maximal $\delta$-subrepetitions we propose two algorithms. The first algorithm has $O(\frac{n\log\log n}{\delta^2})$ time complexity for the case of constant alphabet size and $O(n\log n +\frac{n\log\log n}{\delta^2})$ time complexity for the general case. The second algorithm has $O(n\log n+\frac{n}{\delta^2}\log \frac{1}{\delta})$ expected time complexity.

Includes members:
  Member "efficiently finding all maximal alpha gapped repeats":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the number of gapped repeats with arbitrary gap")
  Member "beyond the runs theorem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prefix frequency of lost positions")
  Member "on primary and secondary repetitions in words":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the number of gapped repeats with arbitrary gap")
  Member "on the maximal sum of exponents of runs in a string":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the runs theorem")
  Member "on maximal repetitions of arbitrary exponent":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal searching of gapped repeats in a word")

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)