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 "lyndon words versus inverse lyndon words queries on suffixes and bordered words"):
  Abstract: Lyndon words have been largely investigated and showned to be a useful tool to prove interesting combinatorial properties of words. In this paper we state new properties of both Lyndon and inverse Lyndon factorizations of a word $w$, with the aim of exploring their use in some classical queries on $w$. #R##N#The main property we prove is related to a classical query on words. We prove that there are relations between the length of the longest common extension (or longest common prefix) $lcp(x,y)$ of two different suffixes $x,y$ of a word $w$ and the maximum length $\mathcal{M}$ of two consecutive factors of the inverse Lyndon factorization of $w$. More precisely, $\mathcal{M}$ is an upper bound on the length of $lcp(x,y)$. This result is in some sense stronger than the compatibility property, proved by Mantaci, Restivo, Rosone and Sciortino for the Lyndon factorization and here for the inverse Lyndon factorization. Roughly, the compatibility property allows us to extend the mutual order between local suffixes of (inverse) Lyndon factors to the suffixes of the whole word. #R##N#A main tool used in the proof of the above results is a property that we state for factors $m_i$ with nonempty borders in an inverse Lyndon factorization: a nonempty border of $m_i$ cannot be a prefix of the next factor $m_{i+1}$. The last property we prove shows that if two words share a common overlap, then their Lyndon factorizations can be used to capture the common overlap of the two words. #R##N#The above results open to the study of new applications of Lyndon words and inverse Lyndon words in the field of string comparison.

Includes members:
  Member "some variations on lyndon words":
    also connected through other hyperedges:
      (none)
  Member "inverse lyndon words and inverse lyndon factorizations of words":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on generalized lyndon words")
  Member "on generalized lyndon words":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the alternating bwt an algorithmic perspective")
  Member "the runs theorem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "matching patterns with variables")
  Member "fsg fast string graph construction for de novo assembly of reads data":
    also connected through other hyperedges:
      (none)
  Member "on the size of lempel ziv and lyndon factorizations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "inverse lyndon words and inverse lyndon factorizations of words")
  Member "an external memory algorithm for string graph construction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "external memory bwt and lcp computation for sequence collections with applications")
  Member "alternative algorithms for lyndon factorization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inverse lyndon words and inverse lyndon factorizations of words")

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)