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: "optimal dynamic strings"
  Abstract: In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical order (less, equal, greater) between two strings, LCP - calculates the longest common prefix of two strings. We present an efficient data structure for this problem, where an update requires only $O(\log n)$ worst-case time with high probability, with $n$ being the total length of all strings in the collection, and a query takes constant worst-case time. On the lower bound side, we prove that even if the only possible query is checking equality of two strings, either updates or queries take amortized $\Omega(\log n)$ time; hence our implementation is optimal. #R##N#Such operations can be used as a basic building block to solve other string problems. We provide two examples. First, we can augment our data structure to provide pattern matching queries that may locate occurrences of a specified pattern $p$ in the strings in our collection in optimal $O(|p|)$ time, at the expense of increasing update time to $O(\log^2 n)$. Second, we show how to maintain a history of an edited text, processing updates in $O(\log t \log \log t)$ time, where $t$ is the number of edits, and how to support pattern matching queries against the whole history in $O(|p| \log t \log \log t)$ time. #R##N#Finally, we note that our data structure can be applied to test dynamic tree isomorphism and to compare strings generated by dynamic straight-line grammars.

Connected through hyperedge HE-1 (induced by source paper "online algorithms for constructing linear size suffix trie"):
  with members:
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "fast label extraction in the cdawg"
    - "alphabet dependent string searching with wexponential search trees"
    - "on line construction of position heaps"

Connected through hyperedge HE-2 (induced by source paper "optimal time dictionary compressed indexes"):
  with members:
    - "optimal rank and select queries on dictionary compressed text"
    - "fast prefix search in little space with applications"
    - "universal compressed text indexing"
    - "representing the suffix tree with the cdawg"
    - "time space trade offs for lempel ziv compressed indexing"
    - "at the roots of dictionary compression string attractors"
    - "compressed indexing with signature grammars"
    - "document listing on repetitive collections with guaranteed performance"

Connected through hyperedge HE-3 (induced by source paper "upper and lower bounds for dynamic data structures on strings"):
  with members:
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "faster online matrix vector multiplication"
    - "a dichotomy for regular expression membership testing"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "which regular expression patterns are hard to match"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"

Connected through hyperedge HE-4 (induced by source paper "compressed indexing with signature grammars"):
  with members:
    - "fast prefix search in little space with applications"
    - "time space trade offs for lempel ziv compressed indexing"
    - "optimal time text indexing in bwt runs bounded space"
    - "longest common extensions with recompression"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "orthogonal range searching on the ram revisited"
    - "faster fully compressed pattern matching by recompression"

Connected through hyperedge HE-5 (induced by source paper "fully dynamic data structure for lce queries in compressed space"):
  with members:
    - "longest common extensions in sublinear space"
    - "finger search random access and longest common extensions in grammar compressed strings"
    - "fingerprints in compressed strings"

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)