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: "compact q gram profiling of compressed strings"
  Abstract: We consider the problem of computing the q-gram profile of a string \str of size $N$ compressed by a context-free grammar with $n$ production rules. We present an algorithm that runs in $O(N-\alpha)$ expected time and uses $O(n+q+\kq)$ space, where $N-\alpha\leq qn$ is the exact number of characters decompressed by the algorithm and $\kq\leq N-\alpha$ is the number of distinct q-grams in $\str$. This simultaneously matches the current best known time bound and improves the best known space bound. Our space bound is asymptotically optimal in the sense that any algorithm storing the grammar and the q-gram profile must use $\Omega(n+q+\kq)$ space. To achieve this we introduce the q-gram graph that space-efficiently captures the structure of a string with respect to its q-grams, and show how to construct it from a grammar.

Connected through hyperedge HE-1 (induced by source paper "practical repetition aware grammar compression"):
  with members:
    - "mr repair grammar compression based on maximal repeats"
    - "repair in compressed space and time"
    - "optimal time text indexing in bwt runs bounded space"
    - "scalable partial least squares regression on grammar compressed data matrices"
    - "space efficient re pair compression"
    - "online pattern matching for string edit distance with moves"
    - "a succinct grammar compression"
    - "approximation of grammar based compression via recompression"

Connected through hyperedge HE-2 (induced by source paper "scalable partial least squares regression on grammar compressed data matrices"):
  with members:
    - "feature hashing for large scale multitask learning"
    - "a unified algorithm for accelerating edit distance computation via text compression"
    - "b bit minwise hashing"

Connected through hyperedge HE-3 (induced by source paper "rank select and access in grammar compressed strings"):
  with members:
    - "compressed subsequence matching and packed tree coloring"
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "data structure lower bounds on random access to grammar compressed strings"
    - "improved grammar based compressed indexes"
    - "fast q gram mining on slp compressed strings"
    - "unified compression based acceleration of edit distance computation"
    - "random access to grammar compressed strings"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

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)