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: "fingerprints in compressed strings"
  Abstract: The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string $S$ of size $N$ compressed by a context-free grammar of size $n$ that answers fingerprint queries. That is, given indices $i$ and $j$, the answer to a query is the fingerprint of the substring $S[i,j]$. We present the first O(n) space data structures that answer fingerprint queries without decompressing any characters. For Straight Line Programs (SLP) we get $O(\log N)$ query time, and for Linear SLPs (an SLP derivative that captures LZ78 compression and its variations) we get $O(\log \log N)$ query time. Hence, our data structures has the same time and space complexity as for random access in SLPs. We utilize the fingerprint data structures to solve the longest common extension problem in query time $O(\log N \log \lce)$ and $O(\log \lce \log\log \lce + \log\log N)$ for SLPs and Linear SLPs, respectively. Here, $\lce$ denotes the length of the LCE.

Connected through hyperedge HE-1 (induced by source paper "local decodability of the burrows wheeler transform"):
  with members:
    - "optimal time text indexing in bwt runs bounded space"
    - "a simple online competitive adaptation of lempel ziv compression with efficient random access support"
    - "succinct representations of permutations and functions"
    - "cell probe lower bounds for prefix sums"

Connected through hyperedge HE-2 (induced by source paper "lightweight fingerprints for fast approximate keyword matching using bitwise operations"):
  with members:
    - "in place longest common extensions"

Connected through hyperedge HE-3 (induced by source paper "longest common extensions with recompression"):
  with members:
    - "in place longest common extensions"
    - "finger search in grammar compressed strings"
    - "approximation of grammar based compression via recompression"
    - "approximation of smallest linear tree grammar"
    - "one variable word equations in linear time"
    - "recompression a simple and powerful technique for word equations"
    - "faster fully compressed pattern matching by recompression"

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

Connected through hyperedge HE-5 (induced by source paper "finger search in grammar compressed strings"):
  with members:
    - "fully dynamic data structure for lce queries in compressed space"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "queries on lz bounded encodings"
    - "compressed subsequence matching and packed tree coloring"
    - "computing convolution on grammar compressed text"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "dynamic index lz factorization and lce queries in compressed space"):
  with members:
    - "online self indexed grammar compression"
    - "approximating lz77 via small space multiple pattern matching"
    - "dynamic data structures for document collections and graphs"
    - "finger search random access and longest common extensions in grammar compressed strings"
    - "restructuring compressed texts without explicit decompression"

Connected through hyperedge HE-7 (induced by source paper "finger search random access and longest common extensions in grammar compressed strings"):
  with members:
    - "data structure lower bounds on random access to grammar compressed strings"

Connected through hyperedge HE-8 (induced by source paper "heaviest induced ancestors and longest common substrings"):
  with members:
    - "orthogonal range searching on the ram revisited"
    - "a faster grammar based self index"

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)