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: "computing runs on a general alphabet"
  Abstract: We describe a RAM algorithm computing all runs (maximal repetitions) of a given string of length $n$ over a general ordered alphabet in $O(n\log^{\frac{2}3} n)$ time and linear space. Our algorithm outperforms all known solutions working in $\Theta(n\log\sigma)$ time provided $\sigma = n^{\Omega(1)}$, where $\sigma$ is the alphabet size. We conjecture that there exists a linear time RAM algorithm finding all runs.

Connected through hyperedge HE-1 (induced by source paper "the runs theorem"):
  with members:
    - "internal pattern matching queries in a text and applications"
    - "lyndon words and short superstrings"
    - "on the maximal sum of exponents of runs in a string"
    - "on bijective variants of the burrows wheeler transform"
    - "new lower bounds for the maximum number of runs in a string"
    - "circle formation of weak robots and lyndon words"

Connected through hyperedge HE-2 (induced by source paper "tight lower bounds for the longest common extension problem"):
  with members:
    - "small space encoding lce data structure with constant time queries"
    - "fast longest common extensions in small space"
    - "faster longest common extension queries in strings over general alphabets"
    - "sparse suffix tree construction in optimal time and space"
    - "in place longest common extensions"
    - "longest common extensions with recompression"
    - "deterministic sub linear space lce data structures with efficient construction"
    - "longest common extensions in sublinear space"

Connected through hyperedge HE-3 (induced by source paper "faster longest common extension queries in strings over general alphabets"):
  with members:
    - "the runs theorem"
    - "longest common extensions in sublinear space"
    - "finding the leftmost critical factorization on unordered alphabet"
    - "online detection of repetitions with backtracking"
    - "lempel ziv factorization may be harder than computing all runs"

Connected through hyperedge HE-4 (induced by source paper "near optimal computation of runs over general alphabet via non crossing lce queries"):
  with members:
    - "the runs theorem"
    - "faster longest common extension queries in strings over general alphabets"
    - "beyond the runs theorem"
    - "internal pattern matching queries in a text and applications"

Connected through hyperedge HE-5 (induced by source paper "finding the leftmost critical factorization on unordered alphabet"):
  with members:
    - "online detection of repetitions with backtracking"
    - "lempel ziv factorization may be harder than computing all runs"

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)