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 lempel ziv factorization simple fast small"
  Abstract: Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization algorithms, some of which require only 2n log n + O(log n) bits of working space to factorize a string of length n. These are the most space efficient linear time algorithms to date, using n log n bits less space than any previous linear time algorithm. The algorithms are also practical, simple to implement, and very fast in practice.

Connected through hyperedge HE-1 (induced by source paper "lempel ziv like parsing in small space"):
  with members:
    - "at the roots of dictionary compression string attractors"
    - "relations between greedy and bit optimal lz77 encodings"
    - "lz end parsing in compressed space"
    - "approximating lz77 via small space multiple pattern matching"
    - "from theory to practice plug and play with succinct data structures"
    - "lempel ziv parsing in external memory"
    - "relative lempel ziv factorization for efficient storage and retrieval of web collections"
    - "large alphabets and incompressibility"

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

Connected through hyperedge HE-3 (induced by source paper "decompressing lempel ziv compressed text"):
  with members:
    - "mergeable dictionaries with shifts"
    - "time space trade offs for lempel ziv compressed indexing"
    - "lempel ziv decoding in external memory"
    - "approximating lz77 via small space multiple pattern matching"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"

Connected through hyperedge HE-4 (induced by source paper "a grammar compression algorithm based on induced suffix sorting"):
  with members:
    - "from theory to practice plug and play with succinct data structures"
    - "improved grammar based compressed indexes"
    - "inducing the lcp array"

Connected through hyperedge HE-5 (induced by source paper "computing all distinct squares in linear time for integer alphabets"):
  with members:
    - "lempel ziv computation in compressed space lz cics"
    - "from theory to practice plug and play with succinct data structures"
    - "inducing the lcp array"

Connected through hyperedge HE-6 (induced by source paper "range predecessor and lempel ziv parsing"):
  with members:
    - "faster lightweight lempel ziv parsing"
    - "wavelet trees meet suffix trees"
    - "linear time construction of compressed text indices in compact space"
    - "queries on lz bounded encodings"
    - "lightweight lempel ziv parsing"
    - "faster compact on line lempel ziv factorization"
    - "succinct indices for range queries with applications to orthogonal range maxima"
    - "sorted range reporting"

Connected through hyperedge HE-7 (induced by source paper "a really simple approximation of smallest grammar"):
  with members:
    - "approximation of grammar based compression via recompression"
    - "approximation of smallest linear tree grammar"
    - "simpler and faster lempel ziv factorization"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"
    - "faster fully compressed pattern matching by recompression"
    - "the similarity metric"
    - "identifying hierarchical structure in sequences a linear time algorithm"

Connected through hyperedge HE-8 (induced by source paper "lempel ziv parsing in external memory"):
  with members:
    - "lightweight lempel ziv parsing"
    - "new lower and upper bounds for representing sequences"
    - "grammar based compression in a streaming model"
    - "lightweight data indexing and compression in external memory"

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)