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: "burrows wheeler transform and lcp array construction in constant space"
  Abstract: Abstract   In this article we extend the elegant in-place Burrows–Wheeler transform (BWT) algorithm proposed by Crochemore et al.  [12] . Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, using constant additional space; we then show how to build the LCP array directly in compressed representation using Elias coding, still using constant additional space and with no asymptotic slowdown. Furthermore, we provide a time/space tradeoff for our algorithm when additional memory is allowed. Our algorithm runs in quadratic time, as does Crochemore et al.'s, and is supported by interesting properties of the BWT and of the LCP array, contributing to our understanding of the time/space tradeoff curve for building indexing structures.

Connected through hyperedge HE-1 (induced by source paper "re pair in place"):
  with members:
    - "a study for image compression using re pair algorithm"
    - "a faster external memory priority queue with decreasekeys"
    - "mr repair grammar compression based on maximal repeats"
    - "repair in compressed space and time"
    - "practical and effective re pair compression"
    - "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets"
    - "optimal in place suffix sorting"
    - "scalable partial least squares regression on grammar compressed data matrices"

Connected through hyperedge HE-2 (induced by source paper "when a dollar makes a bwt"):
  with members:
    - "a suffix tree or not a suffix tree"
    - "on the combinatorics of suffix arrays"

Connected through hyperedge HE-3 (induced by source paper "in place longest common extensions"):
  with members:
    - "small space encoding lce data structure with constant time queries"
    - "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets"
    - "fast longest common extensions in small space"
    - "optimal in place suffix sorting"
    - "tight lower bounds for the longest common extension problem"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "longest common extensions in sublinear space"
    - "searching of gapped repeats and subrepetitions in a word"

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)