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: "linear time construction of compressed text indices in compact space"
  Abstract: We show that the compressed suffix array and the compressed suffix tree for a string of length $n$ over an integer alphabet of size $\sigma\leq n$ can both be built in $O(n)$ (randomized) time using only $O(n\log\sigma)$ bits of working space. The previously fastest construction algorithms that used $O(n\log\sigma)$ bits of space took times $O(n\log\log\sigma)$ and $O(n\log^{\epsilon}n)$ respectively (where $\epsilon$ is any positive constant smaller than $1$). In the passing, we show that the Burrows-Wheeler transform of a string of length $n$ over an alphabet of size $\sigma$ can be built in deterministic $O(n)$ time and space $O(n\log\sigma)$. We also show that within the same time and space, we can carry many sequence analysis tasks and construct some variants of the compressed suffix array and compressed suffix tree.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering"):
  with members:
    - "on the hardness and inapproximability of recognizing wheeler graphs"
    - "resolution of the burrows wheeler transform conjecture"
    - "string synchronizing sets sublinear time bwt construction and optimal lce data structure"
    - "tunneling on wheeler graphs"
    - "efficient construction of a complete index for pan genomics read alignment"
    - "optimal construction of compressed indexes for highly repetitive texts"
    - "at the roots of dictionary compression string attractors"
    - "optimal time text indexing in bwt runs bounded space"

Connected through hyperedge HE-2 (induced by source paper "fully functional bidirectional burrows wheeler indexes"):
  with members:
    - "simulating the dna string graph in succinct space"
    - "assembling omnitigs using hidden order de bruijn graphs"
    - "representing the suffix tree with the cdawg"
    - "fast label extraction in the cdawg"
    - "linear time string indexing and analysis in small space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "variable order de bruijn graphs"
    - "engineering small space dictionary matching"

Connected through hyperedge HE-3 (induced by source paper "string synchronizing sets sublinear time bwt construction and optimal lce data structure"):
  with members:
    - "quasi linear time algorithm for longest common circular factor"
    - "locally consistent parsing for text indexing in small space"
    - "text indexing and searching in sublinear time"
    - "optimal construction of compressed indexes for highly repetitive texts"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "wavelet trees meet suffix trees"
    - "internal pattern matching queries in a text and applications"
    - "recompression a simple and powerful technique for word equations"

Connected through hyperedge HE-4 (induced by source paper "space efficient construction of compressed suffix trees"):
  with members:
    - "space efficient computation of the lcp array from the burrows wheeler transform"
    - "detecting mutations by ebwt"
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "linear time string indexing and analysis in small space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "lightweight lcp construction for very large collections of strings"
    - "optimal dynamic sequence representations"

Connected through hyperedge HE-5 (induced by source paper "lightweight merging of compressed indices based on bwt variants"):
  with members:
    - "space efficient merging of succinct de bruijn graphs"
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "indexing variation graphs"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "lightweight lcp construction for very large collections of strings"
    - "burrows wheeler transform for terabases"
    - "variable order de bruijn graphs"

Connected through hyperedge HE-6 (induced by source paper "simulating the dna string graph in succinct space"):
  with members:
    - "variable order de bruijn graphs"
    - "from theory to practice plug and play with succinct data structures"
    - "fully functional static and dynamic succinct trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-7 (induced by source paper "external memory bwt and lcp computation for sequence collections with applications"):
  with members:
    - "the colored longest common prefix array computed via sequential scans"
    - "computing the bwt and lcp array of a set of strings in external memory"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "lightweight lcp construction for very large collections of strings"
    - "an external memory algorithm for string graph construction"
    - "variable order de bruijn graphs"
    - "lightweight data indexing and compression in external memory"

Connected through hyperedge HE-8 (induced by source paper "fast compressed self indexes with deterministic linear time construction"):
  with members:
    - "fast prefix search in little space with applications"
    - "linear time string indexing and analysis in small space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "deterministic indexing for packed strings"
    - "suffix trays and suffix trists structures for faster text indexing"
    - "alphabet dependent string searching with wexponential search trees"
    - "optimal lower and upper bounds for representing sequences"
    - "compression via matroids a randomized polynomial kernel for odd cycle transversal"

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)