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: "space efficient construction of compressed indexes in deterministic linear time"
  Abstract: We show that the compressed suffix array and the compressed suffix tree of a string $T$ can be built in $O(n)$ deterministic time using $O(n\log\sigma)$ bits of space, where $n$ is the string length and $\sigma$ is the alphabet size. Previously described deterministic algorithms either run in time that depends on the alphabet size or need $\omega(n\log \sigma)$ bits of working space. Our result has immediate applications to other problems, such as yielding the first linear-time LZ77 and LZ78 parsing algorithms that use $O(n \log\sigma)$ bits.

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"
    - "linear time construction of compressed text indices in compact space"
    - "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"
    - "wavelet trees meet suffix trees"
    - "linear time construction of compressed text indices in compact space"
    - "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"
    - "lightweight lcp construction for very large collections of strings"
    - "linear time construction of compressed text indices in compact space"
    - "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"
    - "lightweight lcp construction for very large collections of strings"
    - "burrows wheeler transform for terabases"
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"

Connected through hyperedge HE-6 (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"
    - "an in place framework for exact and approximate shortest unique substring queries"
    - "succinct representations of permutations and functions"

Connected through hyperedge HE-7 (induced by source paper "algorithms to compute the burrows wheeler similarity distribution"):
  with members:
    - "a framework for space efficient string kernels"
    - "from theory to practice plug and play with succinct data structures"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-8 (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"

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)