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: "on compressing permutations and adaptive sorting"
  Abstract: Previous compact representations of permutations have focused on adding a small index on top of the plain data $ $, in order to efficiently support the application of the inverse or the iterated permutation. #R##N#In this paper we initiate the study of techniques that exploit the compressibility of the data itself, while retaining efficient computation of $\pi(i)$ and its inverse. #R##N#In particular, we focus on exploiting {\em runs}, which are subsets (contiguous or not) of the domain where the permutation is monotonic. #R##N#Several variants of those types of runs arise in real applications such as inverted indexes and suffix arrays. #R##N#Furthermore, our improved results on compressed data structures for permutations also yield better adaptive sorting algorithms.

Connected through hyperedge HE-1 (induced by source paper "on adaptive algorithms for maximum matching"):
  with members:
    - "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs"
    - "efficient and adaptive parameterized algorithms on modular decompositions"
    - "parameterized aspects of triangle enumeration"
    - "robust and adaptive search"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "a linear time algorithm for maximum cardinality matching on cocomparability graphs"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"

Connected through hyperedge HE-2 (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"
    - "orthogonal range searching on the ram revisited"
    - "succinct representations of permutations and functions"
    - "fully functional static and dynamic succinct trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-3 (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"
    - "the cell probe complexity of dynamic range counting"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-4 (induced by source paper "smooth heaps and a dual view of self adjusting data structures"):
  with members:
    - "weighted dynamic finger in binary search trees"
    - "improved bounds for multipass pairing heaps and path balanced binary search trees"
    - "pairing heaps the forward variant"
    - "the landscape of bounds for binary search trees"
    - "pattern avoiding access in binary search trees"
    - "greedy is an almost optimal deque"
    - "a back to basics empirical study of priority queues"
    - "a tight lower bound for decrease key in the pure heap model"

Connected through hyperedge HE-5 (induced by source paper "a compact representation for trips over networks built on self indexes"):
  with members:
    - "cinct compression and retrieval for massive vehicular trajectories via relative movement labeling"
    - "compact trip representation over networks"
    - "efficient and compact representations of some non canonical prefix free codes"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "compressed text indexes from theory to practice"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-6 (induced by source paper "adaptive shivers sort an alternative sorting algorithm"):
  with members:
    - "on the worst case complexity of timsort"
    - "strategies for stable merge sorting"
    - "nearly optimal mergesorts fast practical sorting methods that optimally adapt to existing runs"

Connected through hyperedge HE-7 (induced by source paper "on the worst case complexity of timsort"):
  with members:
    - "strategies for stable merge sorting"
    - "nearly optimal mergesorts fast practical sorting methods that optimally adapt to existing runs"

Connected through hyperedge HE-8 (induced by source paper "grammar compressed sequences with rank select support"):
  with members:
    - "queries on lz bounded encodings"
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "a succinct grammar compression"
    - "compact binary relation representations with rich functionality"
    - "data structure lower bounds on random access to grammar compressed strings"
    - "optimal lower and upper bounds for representing sequences"
    - "optimal trade off for succinct string indexes"
    - "efficient fully compressed sequence representations"

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)