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: "lightweight lcp construction for very large collections of strings"
  Abstract: The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from "next-generation" DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows-Wheeler transform of a very large collection of strings having any length. The computation is realized by performing disk data accesses only via sequential scans, and the total disk space usage never needs more than twice the output size, excluding the disk space required for the input. Moreover, extLCP allows to compute also the suffix array of the strings of the collection, without any other further data structure is needed. Finally, we test our algorithm on real data and compare our results with another tool capable to work in external memory on large collections of strings.

Connected through hyperedge HE-1 (induced by source paper "the alternating bwt an algorithmic perspective"):
  with members:
    - "a new class of searchable and provably highly compressible string transformations"
    - "on generalized lyndon words"
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "large scale compression of genomic sequence databases with the burrows wheeler transform"
    - "optimal lower and upper bounds for representing sequences"
    - "on optimally partitioning a text to improve its compression"
    - "a note on the burrows wheeler transformation"

Connected through hyperedge HE-2 (induced by source paper "space efficient construction of compressed suffix trees"):
  with members:
    - "space efficient computation of the lcp array from the burrows wheeler transform"
    - "detecting mutations by ebwt"
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "linear time string indexing and analysis in small space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "linear time construction of compressed text indices in compact space"
    - "optimal dynamic sequence representations"

Connected through hyperedge HE-3 (induced by source paper "lightweight merging of compressed indices based on bwt variants"):
  with members:
    - "space efficient merging of succinct de bruijn graphs"
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "indexing variation graphs"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "burrows wheeler transform for terabases"
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"

Connected through hyperedge HE-4 (induced by source paper "external memory bwt and lcp computation for sequence collections with applications"):
  with members:
    - "the colored longest common prefix array computed via sequential scans"
    - "computing the bwt and lcp array of a set of strings in external memory"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "an external memory algorithm for string graph construction"
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"
    - "lightweight data indexing and compression in external memory"

Connected through hyperedge HE-5 (induced by source paper "the colored longest common prefix array computed via sequential scans"):
  with members:
    - "external memory bwt and lcp computation for sequence collections with applications"
    - "fast label extraction in the cdawg"

Connected through hyperedge HE-6 (induced by source paper "burrows wheeler transform and lcp array construction in constant space"):
  with members:
    - "linear time string indexing and analysis in small space"
    - "low space external memory construction of the succinct permuted longest common prefix array"
    - "faster average case low memory semi external construction of the burrows wheeler transform"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "in place longest common extensions"
    - "linear time construction of compressed text indices in compact space"
    - "lightweight lcp construction for next generation sequencing datasets"
    - "optimal dynamic sequence representations"

Connected through hyperedge HE-7 (induced by source paper "from h m to gap for lightweight bwt merging"):
  with members:
    - "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)