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 "fast computation of abelian runs"):
  Abstract: Abstract   Given a word w and a Parikh vector    P   , an abelian run of period    P    in w is a maximal occurrence of a substring of w having abelian period    P   . Our main result is an online algorithm that, given a word w of length n over an alphabet of cardinality σ and a Parikh vector    P   , returns all the abelian runs of period    P    in w in time    O  (  n  )    and space    O  (  σ  +  p  )   , where p is the norm of    P   , i.e., the sum of its components. We also present an online algorithm that computes all the abelian runs with periods of norm p in w in time    O  (  n  p  )   , for any given norm p. Finally, we give an    O  (    n    2    )   -time offline randomized algorithm for computing all the abelian runs of w. Its deterministic counterpart runs in    O  (    n    2    log  ⁡  σ  )    time.

Includes members:
  Member "the runs theorem":
    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 "online computation of abelian runs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing abelian regularities on rle strings")

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)