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: "fully dynamic data structure for lce queries in compressed space"
  Abstract: A Longest Common Extension (LCE) query on a text T of length N asks for the length of the longest common prefix of suffixes starting at given two positions. We show that the signature encoding G of size w = O(min(z logN log M,N)) [Mehlhorn et al., Algorithmica 17(2):183-198, 1997] of T , which can be seen as a compressed representation of T , has a capability to support LCE queries in O(logN + log l log M) time, where l is the answer to the query, z is the size of the Lempel-Ziv77 (LZ77) factorization of T , and M ≥ 4N is an integer that can be handled in constant time under word RAM model. In compressed space, this is the fastest deterministic LCE data structure in many cases. Moreover, G can be enhanced to support efficient update operations: After processing G in O(wfA) time, we can insert/delete any (sub)string of length y into/from an arbitrary position of T in O((y+ logN log M)fA) time, where fA = O(min{ log logM log logw log log logM , √ logw log logw }). This yields the first fully dynamic LCE data structure working in compressed space. We also present efficient construction algorithms from various types of inputs: We can construct G in O(NfA) time from uncompressed string T ; in O(n log log(n log M) logN log M) time from grammar-compressed string T represented by a straight-line program of size n; and in O(zfA logN log ∗ M) time from LZ77-compressed string T with z factors. On top of the above contributions, we show several applications of our data structures which improve previous best known results on grammar-compressed string processing.

Connected through hyperedge HE-1 (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-2 (induced by source paper "universal compressed text indexing"):
  with members:
    - "fast prefix search in little space with applications"
    - "time space trade offs for lempel ziv compressed indexing"
    - "at the roots of dictionary compression string attractors"
    - "compressed indexing with signature grammars"
    - "fast label extraction in the cdawg"
    - "optimal time text indexing in bwt runs bounded space"
    - "sparse suffix tree construction in optimal time and space"
    - "a self index on block trees"

Connected through hyperedge HE-3 (induced by source paper "on the approximation ratio of greedy parsings"):
  with members:
    - "optimal time dictionary compressed indexes"
    - "at the roots of dictionary compression string attractors"
    - "compression with the tudocomp framework"
    - "optimal time text indexing in bwt runs bounded space"
    - "a separation between run length slps and lz77"
    - "composite repetition aware data structures"
    - "factorizations of the fibonacci infinite word"
    - "queries on lz bounded encodings"

Connected through hyperedge HE-4 (induced by source paper "document listing on repetitive collections with guaranteed performance"):
  with members:
    - "fast prefix search in little space with applications"
    - "universal compressed text indexing"
    - "time space trade offs for lempel ziv compressed indexing"
    - "compressed indexing with signature grammars"
    - "optimal time text indexing in bwt runs bounded space"
    - "document retrieval on repetitive string collections"
    - "composite repetition aware data structures"
    - "document retrieval on repetitive collections"

Connected through hyperedge HE-5 (induced by source paper "optimal time text indexing in bwt runs bounded space"):
  with members:
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "fast label extraction in the cdawg"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "universal indexes for highly repetitive document collections"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "composite repetition aware data structures"
    - "computing lz77 in run compressed space"
    - "queries on lz bounded encodings"

Connected through hyperedge HE-6 (induced by source paper "a compressed dynamic self index for highly repetitive text collections"):
  with members:
    - "optimal time dictionary compressed indexes"
    - "universal compressed text indexing"
    - "small space encoding lce data structure with constant time queries"
    - "time space trade offs for lempel ziv compressed indexing"
    - "at the roots of dictionary compression string attractors"
    - "compressed indexing with signature grammars"
    - "optimal time text indexing in bwt runs bounded space"
    - "a self index on block trees"

Connected through hyperedge HE-7 (induced by source paper "at the roots of dictionary compression string attractors"):
  with members:
    - "representing the suffix tree with the cdawg"
    - "time space trade offs for lempel ziv compressed indexing"
    - "fast label extraction in the cdawg"
    - "optimal time text indexing in bwt runs bounded space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "composite repetition aware data structures"
    - "linear time construction of compressed text indices in compact space"
    - "queries on lz bounded encodings"

Connected through hyperedge HE-8 (induced by source paper "a separation between run length slps and lz77"):
  with members:
    - "optimal time text indexing in bwt runs bounded space"

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)