human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "algorithms for longest common abelian factors"
  Abstract: In this paper we consider the problem of computing the longest common abelian factor (LCAF) between two given strings. We present a simple $O(\sigma~ n^2)$ time algorithm, where $n$ is the length of the strings and $\sigma$ is the alphabet size, and a sub-quadratic running time solution for the binary string case, both having linear space requirement. Furthermore, we present a modified algorithm applying some interesting tricks and experimentally show that the resulting algorithm runs faster.

Connected through hyperedge HE-1 (induced by source paper "on abelian longest common factor with and without rle"):
  with members:
    - "computing abelian regularities on rle strings"
    - "clustered integer 3sum via additive combinatorics"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled string matching for highly run length compressible texts"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-2 (induced by source paper "on the parikh de bruijn grid"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "string reconstruction from substring compositions"
    - "algorithms for computing abelian periods of words"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled string matching for highly run length compressible texts"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-3 (induced by source paper "computing abelian regularities on rle strings"):
  with members:
    - "online computation of abelian runs"
    - "a note on the longest common abelian factor problem"
    - "algorithms for computing abelian periods of words"
    - "a note on efficient computation of all abelian periods in a string"

Connected through hyperedge HE-4 (induced by source paper "a note on the longest common abelian factor problem"):
  with members:
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "sublinear space algorithms for the longest common substring problem"

Question: Please tell me which class the center node 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)