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: "an in place framework for exact and approximate shortest unique substring queries"
  Abstract: We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as computational biology. We design a generic in-place framework that fits to solve both the exact and approximate $k$-mismatch SUS finding, using the minimum $2n$ memory words plus $n$ bytes space, where $n$ is the input string size. By using the in-place framework, we can find the exact and approximate $k$-mismatch SUS for every string position using a total of $O(n)$ and $O(n^2)$ time, respectively, regardless of the value of $k$. Our framework does not involve any compressed or succinct data structures and thus is practical and easy to implement.

Connected through hyperedge HE-1 (induced by source paper "compact data structures for shortest unique substring queries"):
  with members:
    - "a faster implementation of online run length burrows wheeler transform"
    - "optimal construction of compressed indexes for highly repetitive texts"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "succinct representations of permutations and functions"

Connected through hyperedge HE-2 (induced by source paper "shortest unique palindromic substring queries on run length encoded strings"):
  with members:
    - "eertree an efficient data structure for processing palindromes in strings"
    - "shortest unique substring query revisited"

Connected through hyperedge HE-3 (induced by source paper "shortest unique palindromic substring queries in optimal time"):
  with members:
    - "diverse palindromic factorization is np complete"
    - "eertree an efficient data structure for processing palindromes in strings"
    - "a subquadratic algorithm for minimum palindromic factorization"
    - "shortest unique substring query revisited"

Connected through hyperedge HE-4 (induced by source paper "tight bound on the maximum number of shortest unique substrings"):
  with members:
    - "on stabbing queries for generalized longest repeat"
    - "shortest unique substring query revisited"

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)