human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "optimal dynamic strings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online algorithms for constructing linear size suffix trie")
  Member "longest common extensions in sublinear space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "string indexing with compressed patterns")
  Member "finger search random access and longest common extensions in grammar compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic index lz factorization and lce queries in compressed space")
  Member "fingerprints in compressed strings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local decodability of the burrows wheeler transform")

Question: Please tell me which class the source paper 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)