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 "inverse lyndon words and inverse lyndon factorizations of words"):
  Abstract: Abstract   Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon words with respect to the inverse lexicographic order. The Lyndon factorization of a nonempty word  w  is unique but  w  may have several inverse Lyndon factorizations. We prove that any nonempty word  w  admits a canonical inverse Lyndon factorization, named    ICFL  (  w  )   , that maintains the main properties of the Lyndon factorization of  w : it can be computed in linear time, it is uniquely determined, and it preserves a compatibility property for sorting suffixes. In particular, the compatibility property of    ICFL  (  w  )    is a consequence of another result: any factor in    ICFL  (  w  )    is a concatenation of consecutive factors of the Lyndon factorization of  w  with respect to the inverse lexicographic order.

Includes members:
  Member "on the size of lempel ziv and lyndon factorizations":
    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 "alternative algorithms for lyndon factorization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "sorting suffixes of a text via its lyndon factorization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "lyndon words and short superstrings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "a bijective string sorting transform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "on bijective variants of the burrows wheeler transform":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "a note on the burrows wheeler transformation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered 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)