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 computing abelian periods of words"
  Abstract: Constantinescu and Ilie [S. Constantinescu, L. Ilie. Fine and Wilf's theorem for abelian periods, Bulletin of the European Association for Theoretical Computer Science 89 (2006) 167-170] introduced the notion of an Abelian period of a word. A word of length n over an alphabet of size @s can have @Q(n^2) distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time O(n^[email protected]) using O([email protected]) space. We present an offline algorithm based on a select function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present online algorithms that also enable us to compute all the Abelian periods of all the prefixes of w.

Connected through hyperedge HE-1 (induced by source paper "string periods in the order preserving model"):
  with members:
    - "a note on easy and efficient computation of full abelian periods of a word"
    - "an encoding for order preserving matching"
    - "efficient algorithms for the order preserving pattern matching problem"
    - "single and multiple consecutive permutation motif search"
    - "a note on efficient computation of all abelian periods in a string"

Connected through hyperedge HE-2 (induced by source paper "on the parikh de bruijn grid"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "algorithms for longest common abelian factors"
    - "string reconstruction from substring compositions"
    - "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 longest common abelian factors"
    - "a note on efficient computation of all abelian periods in a string"

Connected through hyperedge HE-4 (induced by source paper "dyck words lattice paths and abelian borders"):
  with members:
    - "abelian bordered factors and periodicity"
    - "algorithms for jumbled pattern matching in strings"
    - "a note on efficient computation of all abelian periods in a string"

Connected through hyperedge HE-5 (induced by source paper "a note on easy and efficient computation of full abelian periods of a word"):
  with members:
    - "identifying all abelian periods of a string in quadratic time and relevant problems"
    - "a note on efficient computation of all abelian periods in a string"

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)