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: "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
  Abstract: We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and select(i), which returns the ith smallest element in S. We give a data structure that supports both operations in O(1) time on the RAM model and requires B(n, m) p o(n) p O(lg lg m) bits to store a set of size n, where B(n, m) e ⌊lg (m/n)⌋ is the minimum number of bits required to store any n-element subset from a universe of size m. Previous dictionaries taking this space only supported (yes/no) membership queries in O(1) time. In the cell probe model we can remove the O(lg lg m) additive term in the space bound, answering a question raised by Fich and Miltersen [1995] and Pagh [2001].   We present extensions and applications of our indexable dictionary data structure, including:   —an information-theoretically optimal representation of a k-ary cardinal tree that supports standard operations in constant time;   —a representation of a multiset of size n from {0,…,m − 1} in B(n, m p n) p o(n) bits that supports (appropriate generalizations of) rank and select operations in constant time; and p O(lg lg m)   —a representation of a sequence of n nonnegative integers summing up to m in B(n, m p n) p o(n) bits that supports prefix sum queries in constant time.

Connected through hyperedge HE-1 (induced by source paper "path query data structures in practice"):
  with members:
    - "aggregated 2d range queries on clustered points"
    - "orthogonal range searching on the ram revisited"
    - "succinct representations of permutations and functions"
    - "range quantile queries another virtue of wavelet trees"
    - "range mode and range median queries on lists and trees"

Connected through hyperedge HE-2 (induced by source paper "slim graph practical lossy graph compression for approximate graph processing storage and analytics"):
  with members:
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "active access a mechanism for high performance distributed data centric computations"
    - "communication efficient jaccard similarity for high performance distributed genome comparisons"
    - "local computation algorithms for spanners"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"

Connected through hyperedge HE-3 (induced by source paper "top tree compression of tries"):
  with members:
    - "dynamic packed compact tries revisited"
    - "universal compressed text indexing"
    - "packed compact tries a fast and efficient data structure for online string processing"
    - "linear size cdawg new repetition aware indexing and grammar compression"
    - "time space trade offs for lempel ziv compressed indexing"
    - "compressed indexing with signature grammars"
    - "deterministic indexing for packed strings"
    - "composite repetition aware data structures"

Connected through hyperedge HE-4 (induced by source paper "energy consumption in compact integer vectors a study case"):
  with members:
    - "energy efficient algorithms"
    - "compact binary relation representations with rich functionality"
    - "optimal lower and upper bounds for representing sequences"
    - "on compressing permutations and adaptive sorting"
    - "orthogonal range searching on the ram revisited"
    - "succinct representations of permutations and functions"
    - "fully functional static and dynamic succinct trees"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-5 (induced by source paper "how to store a random walk"):
  with members:
    - "local decodability of the burrows wheeler transform"
    - "on locally decodable source coding"
    - "a simple online competitive adaptation of lempel ziv compression with efficient random access support"
    - "on compressing permutations and adaptive sorting"
    - "the cell probe complexity of dynamic range counting"

Connected through hyperedge HE-6 (induced by source paper "simulating the dna string graph in succinct space"):
  with members:
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"
    - "from theory to practice plug and play with succinct data structures"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-7 (induced by source paper "faster repetition aware compressed suffix trees based on block trees"):
  with members:
    - "representing the suffix tree with the cdawg"
    - "optimal time text indexing in bwt runs bounded space"
    - "queries on lz bounded encodings"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-8 (induced by source paper "nearly optimal static las vegas succinct dictionary"):
  with members:
    - "how to store a random walk"
    - "optimal succinct rank data structure via approximate nonnegative tensor decomposition"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"

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)