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 "the alternating bwt an algorithmic perspective"):
  Abstract: The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several area in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in [Gessel et al. 2012] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in [Giancarlo et al. 2018], where we have shown that BWT and ABWT are part of a larger class of reversible transformations, here we provide a combinatorial and algorithmic study of the novel transform ABWT. We establish a deep analogy between BWT and ABWT by proving they are the only ones in the above mentioned class to be rank-invertible, a novel notion guaranteeing efficient invertibility. In addition, we show that the backward-search procedure can be efficiently generalized to the ABWT; this result implies that also the ABWT can be used as a basis for efficient compressed full text indices. Finally, we prove that the ABWT can be efficiently computed by using a combination of the Difference Cover suffix sorting algorithm [Karkkainen et al., 2006] with a linear time algorithm for finding the minimal cyclic rotation of a word with respect to the alternating lexicographical order.

Includes members:
  Member "a new class of searchable and provably highly compressible string transformations":
    also connected through other hyperedges:
      (none)
  Member "on generalized lyndon words":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "external memory bwt and lcp computation for sequence collections with applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient construction of compressed suffix trees")
  Member "lightweight lcp construction for very large collections of strings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space efficient construction of compressed suffix trees")
  Member "large scale compression of genomic sequence databases with the burrows wheeler transform":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local decode and update for big data compression")
  Member "optimal lower and upper bounds for representing sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy consumption in compact integer vectors a study case")
  Member "on optimally partitioning a text to improve its compression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimally partitioning variable byte codes")
  Member "a note on the burrows wheeler transformation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")

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)