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 "longest property preserved common factor"):
  Abstract: In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string $x$ and we are asked to construct a data structure over $x$ answering the following type of on-line queries: given string $y$, find a longest square-free factor common to $x$ and $y$. In the second setting, we are given $k$ strings and an integer $1 < k'\leq k$ and we are asked to find a longest periodic factor common to at least $k'$ strings. In the third setting, we are given two strings and we are asked to find a longest palindromic factor common to the two strings. We present linear-time solutions for all settings. We anticipate that our paradigm can be extended to other string properties or settings.

Includes members:
  Member "linear time algorithm for long lcf with k mismatches":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient computation of sequence mappability")
  Member "indexing weighted sequences neat and efficient":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "experimental evaluation of algorithms for computing quasiperiods")
  Member "the runs theorem":
    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 "a hardness result and new algorithm for the longest common palindromic subsequence problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "faster str ec lcs computation")
  Member "sublinear space algorithms for the longest common substring problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time space tradeoffs for finding a long common substring")
  Member "computing a longest common palindromic subsequence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a hardness result and new algorithm for the longest common palindromic subsequence problem")

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.DS(Data Structures and Algorithms)