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: "a succinct data structure for self indexing ternary relations"
  Abstract: Abstract   The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary relations have not received as much attention, even though many real-world applications require the processing of ternary relations.  In this paper we present a new compressed and self-indexed data structure that we call Interleaved      K    2     -tree (I     K    2     -tree), designed to compactly represent and efficiently query general ternary relations. The I     K    2     -tree is an evolution of an existing data structure, the      K    2     -tree  [6] , initially designed to represent Web graphs and later applied to other domains. The I     K    2     -tree is able to extend the      K    2     -tree to represent a ternary relation, based on the idea of decomposing it into a collection of binary relations but providing indexing capabilities in all the three dimensions. We present different ways to use I     K    2     -tree to model different types of ternary relations using as reference two typical domains: RDF and Temporal Graphs. We also experimentally evaluate our representations comparing them in space usage and performance with other solutions of the state of the art.

Connected through hyperedge HE-1 (induced by source paper "extending general compact querieable representations to gis applications"):
  with members:
    - "compressed representation of dynamic binary relations with applications"
    - "aggregated 2d range queries on clustered points"
    - "orthogonal range searching on the ram revisited"

Connected through hyperedge HE-2 (induced by source paper "faster dynamic compressed d ary relations"):
  with members:
    - "compact and efficient representation of general graph databases"
    - "towards a compact representation of temporal rasters"
    - "compressed representation of dynamic binary relations with applications"
    - "aggregated 2d range queries on clustered points"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "fully functional static and dynamic succinct trees"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-3 (induced by source paper "compact and efficient representation of general graph databases"):
  with members:
    - "a framework of dynamic data structures for string processing"
    - "compressed representation of dynamic binary relations with applications"

Connected through hyperedge HE-4 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations"):
  with members:
    - "grammar based graph compression"
    - "compressing networks with super nodes"
    - "graphzip dictionary based compression for mining graph streams"
    - "parallel construction of compact planar embeddings"
    - "compressed representation of dynamic binary relations with applications"
    - "fully dynamic de bruijn graphs"
    - "compressing graphs and indexes with recursive graph bisection"
    - "on the implicit graph conjecture"

Connected through hyperedge HE-5 (induced by source paper "about birds project bioinformatics and information retrieval data structures analysis and design"):
  with members:
    - "compact representations of event sequences"
    - "parallel construction of wavelet trees on multicore architectures"
    - "run compressed rank select for large alphabets"
    - "efficient compression and indexing of trajectories"
    - "grammar compressed sequences with rank select support"
    - "compressed representation of dynamic binary relations with applications"
    - "aggregated 2d range queries on clustered points"
    - "navigational rule derivation an algorithm to determine the effect of traffic signs on road networks"

Connected through hyperedge HE-6 (induced by source paper "grammar based graph compression"):
  with members:
    - "traversing grammar compressed trees with constant delay"
    - "compressed tree canonization"
    - "recompression a simple and powerful technique for word equations"
    - "fast and tiny structural self indexes for xml"
    - "structure induction by lossless graph compression"
    - "approximation algorithms for pspace hard hierarchically and periodically specified problems"
    - "identifying hierarchical structure in sequences a linear time algorithm"

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)