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: "dynamic index lz factorization and lce queries in compressed space"
  Abstract: In this paper, we present the following results: (1) We propose a new \emph{dynamic compressed index} of $O(w)$ space, that supports searching for a pattern $P$ in the current text in $O(|P| f(M,w) + \log w \log |P| \log^* M (\log N + \log |P| \log^* M) + \mathit{occ} \log N)$ time and insertion/deletion of a substring of length $y$ in $O((y+ \log N\log^* M)\log w \log N \log^* M)$ time, where $N$ is the length of the current text, $M$ is the maximum length of the dynamic text, $z$ is the size of the Lempel-Ziv77 (LZ77) factorization of the current text, $f(a,b) = O(\min \{ \frac{\log\log a \log\log b}{\log\log\log a}, \sqrt{\frac{\log b}{\log\log b}} \})$ and $w = O(z \log N \log^*M)$. (2) We propose a new space-efficient LZ77 factorization algorithm for a given text of length $N$, which runs in $O(N f(N,w') + z \log w' \log^3 N (\log^* N)^2)$ time with $O(w')$ working space, where $w' =O(z \log N \log^* N)$. (3) We propose a data structure of $O(w)$ space which supports longest common extension (LCE) queries on the text in $O(\log N + \log \ell \log^* N)$ time, where $\ell$ is the output LCE length. On top of the above contributions, we show several applications of our data structures which improve previous best known results on grammar-compressed string processing.

Connected through hyperedge HE-1 (induced by source paper "rpair rescaling repair with rsync"):
  with members:
    - "gract a grammar based compressed index for trajectory data"
    - "mr repair grammar compression based on maximal repeats"
    - "prefix free parsing for building big bwts"
    - "time space trade offs for lempel ziv compressed indexing"
    - "compressed indexing with signature grammars"
    - "universal indexes for highly repetitive document collections"
    - "a really simple approximation of smallest grammar"
    - "approximation of grammar based compression via recompression"

Connected through hyperedge HE-2 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space"):
  with members:
    - "resolution of the burrows wheeler transform conjecture"
    - "faster repetition aware compressed suffix trees based on block trees"
    - "optimal time dictionary compressed indexes"
    - "fast prefix search in little space with applications"
    - "efficient construction of a complete index for pan genomics read alignment"
    - "on the approximation ratio of greedy parsings"
    - "universal compressed text indexing"
    - "prefix free parsing for building big bwts"

Connected through hyperedge HE-3 (induced by source paper "optimal time text indexing in bwt runs bounded space"):
  with members:
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "fast label extraction in the cdawg"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "fully dynamic data structure for lce queries in compressed space"
    - "universal indexes for highly repetitive document collections"
    - "composite repetition aware data structures"
    - "computing lz77 in run compressed space"
    - "queries on lz bounded encodings"

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"
    - "optimal dynamic strings"
    - "orthogonal range searching on the ram revisited"
    - "faster fully compressed pattern matching by recompression"

Connected through hyperedge HE-5 (induced by source paper "in place longest common extensions"):
  with members:
    - "small space encoding lce data structure with constant time queries"
    - "burrows wheeler transform and lcp array construction in constant space"
    - "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets"
    - "fast longest common extensions in small space"
    - "optimal in place suffix sorting"
    - "tight lower bounds for the longest common extension problem"
    - "longest common extensions in sublinear space"
    - "searching of gapped repeats and subrepetitions in a word"

Connected through hyperedge HE-6 (induced by source paper "a self index on block trees"):
  with members:
    - "universal indexes for highly repetitive document collections"
    - "queries on lz bounded encodings"
    - "a really simple approximation of smallest grammar"
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "approximation of grammar based compression via recompression"
    - "orthogonal range searching on the ram revisited"
    - "improved grammar based compressed indexes"
    - "succinct representations of permutations and functions"

Connected through hyperedge HE-7 (induced by source paper "fast longest common extensions in small space"):
  with members:
    - "longest common extensions in sublinear space"
    - "searching of gapped repeats and subrepetitions in a word"

Connected through hyperedge HE-8 (induced by source paper "finger search in grammar compressed strings"):
  with members:
    - "fully dynamic data structure for lce queries in compressed space"
    - "queries on lz bounded encodings"
    - "compressed subsequence matching and packed tree coloring"
    - "computing convolution on grammar compressed text"
    - "fingerprints in compressed strings"
    - "data structure lower bounds on random access to grammar compressed strings"
    - "a faster grammar based self index"
    - "identifying hierarchical structure in sequences a linear time algorithm"

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)