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: "compressed indexing with signature grammars"
  Abstract: The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$. #R##N#We present a data structure that supports pattern matching queries in $O(m + occ (\lg\lg n + \lg^\epsilon z))$ time using $O(z \lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\epsilon > 0$, when the alphabet is small or the compression ratio is at least polynomial. We also present two data structures for the general case; one where the space is increased by $O(z\lg\lg z)$, and one where the query time changes from worst-case to expected. #R##N#In all cases, the results improve the previously best known solutions. Notably, this is the first data structure that decides if $P$ occurs in $S$ in $O(m)$ time using $O(z\lg(n/z))$ space. #R##N#Our results are mainly obtained by a novel combination of a randomized grammar construction algorithm with well known techniques relating pattern matching to 2D-range reporting.

Connected through hyperedge HE-1 (induced by source paper "top tree compression of tries"):
  with members:
    - "dynamic packed compact tries revisited"
    - "universal compressed text indexing"
    - "packed compact tries a fast and efficient data structure for online string processing"
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "time space trade offs for lempel ziv compressed indexing"
    - "deterministic indexing for packed strings"
    - "composite repetition aware data structures"
    - "tree compression with top trees revisited"

Connected through hyperedge HE-2 (induced by source paper "towards a definitive measure of repetitiveness"):
  with members:
    - "resolution of the burrows wheeler transform conjecture"
    - "optimal rank and select queries on dictionary compressed text"
    - "optimal time dictionary compressed indexes"
    - "fully functional suffix trees and optimal text searching in bwt runs bounded space"
    - "on the approximation ratio of greedy parsings"
    - "universal compressed text indexing"
    - "representing the suffix tree with the cdawg"
    - "time space trade offs for lempel ziv compressed indexing"

Connected through hyperedge HE-3 (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"
    - "universal indexes for highly repetitive document collections"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "a really simple approximation of smallest grammar"
    - "approximation of grammar based compression via recompression"

Connected through hyperedge HE-4 (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-5 (induced by source paper "universal compressed text indexing"):
  with members:
    - "fast prefix search in little space with applications"
    - "time space trade offs for lempel ziv compressed indexing"
    - "at the roots of dictionary compression string attractors"
    - "fast label extraction in the cdawg"
    - "optimal time text indexing in bwt runs bounded space"
    - "sparse suffix tree construction in optimal time and space"
    - "a self index on block trees"
    - "dynamic index and lz factorization in compressed space"

Connected through hyperedge HE-6 (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"
    - "document listing on repetitive collections with guaranteed performance"
    - "optimal time text indexing in bwt runs bounded space"

Connected through hyperedge HE-7 (induced by source paper "document listing on repetitive collections with guaranteed performance"):
  with members:
    - "fast prefix search in little space with applications"
    - "universal compressed text indexing"
    - "time space trade offs for lempel ziv compressed indexing"
    - "optimal time text indexing in bwt runs bounded space"
    - "document retrieval on repetitive string collections"
    - "fully dynamic data structure for lce queries in compressed space"
    - "composite repetition aware data structures"
    - "document retrieval on repetitive collections"

Connected through hyperedge HE-8 (induced by source paper "a compressed dynamic self index for highly repetitive text collections"):
  with members:
    - "optimal time dictionary compressed indexes"
    - "universal compressed text indexing"
    - "small space encoding lce data structure with constant time queries"
    - "time space trade offs for lempel ziv compressed indexing"
    - "at the roots of dictionary compression string attractors"
    - "optimal time text indexing in bwt runs bounded space"
    - "a self index on block trees"
    - "dynamic index and lz factorization in compressed space"

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)