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 "normal abby normal prefix normal"):
  Abstract: A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes to stay normal but Bob wants to drive her “abnormal” – we discuss which parameter settings allow Alice to succeed.

Includes members:
  Member "on combinatorial generation of prefix normal words":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generating a gray code for prefix normal words in amortized polylogarithmic time per word")
  Member "binary jumbled pattern matching via all pairs shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on abelian longest common factor with and without rle")
  Member "new algorithms for binary jumbled pattern matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "indexes for jumbled pattern matching in strings trees and graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "binary jumbled string matching for highly run length compressible texts":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on abelian longest common factor with and without rle")
  Member "binary jumbled pattern matching on trees and tree like structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "on prefix normal words":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generating a gray code for prefix normal words in amortized polylogarithmic time per 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)