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: "compressed representation of dynamic binary relations with applications"
  Abstract: We introduce a dynamic data structure for the compact representation of binary relations $\mathcal{R} \subseteq A \times B$. The data structure is a dynamic variant of the k$^2$-tree, a static compact representation that takes advantage of clustering in the binary relation to achieve compression. Our structure can efficiently check whether two objects $(a,b) \in A \times B$ are related, and list the objects of $B$ related to some $a \in A$ and vice versa. Additionally, our structure allows inserting and deleting pairs $(a,b)$ in the relation, as well as modifying the base sets $A$ and $B$. We test our dynamic data structure in different contexts, including the representation of Web graphs and RDF databases. Our experiments show that our dynamic data structure achieves good compression ratios and fast query times, close to those of a static representation, while also providing efficient support for updates in the represented binary relation.

Connected through hyperedge HE-1 (induced by source paper "compressed data structures for binary relations in practice"):
  with members:
    - "simd compression and the intersection of sorted integers"
    - "compact binary relation representations with rich functionality"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"

Connected through hyperedge HE-2 (induced by source paper "extending general compact querieable representations to gis applications"):
  with members:
    - "a succinct data structure for self indexing ternary relations"
    - "aggregated 2d range queries on clustered points"
    - "orthogonal range searching on the ram revisited"

Connected through hyperedge HE-3 (induced by source paper "optimal joins using compact data structures"):
  with members:
    - "worst case optimal join algorithms techniques results and open problems"
    - "size bounds and query plans for relational joins"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "join processing for graph patterns an old dog with new tricks"
    - "faq questions asked frequently"
    - "joins via geometric resolutions worst case and beyond"
    - "faster compressed quadtrees"
    - "beyond worst case analysis for joins with minesweeper"

Connected through hyperedge HE-4 (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"
    - "a succinct data structure for self indexing ternary relations"
    - "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-5 (induced by source paper "on dynamic succinct graph representations"):
  with members:
    - "faster dynamic compressed d ary relations"
    - "dynamic data structures for document collections and graphs"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"

Connected through hyperedge HE-6 (induced by source paper "compact and efficient representation of general graph databases"):
  with members:
    - "a framework of dynamic data structures for string processing"
    - "a succinct data structure for self indexing ternary relations"

Connected through hyperedge HE-7 (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"
    - "a succinct data structure for self indexing ternary relations"
    - "fully dynamic de bruijn graphs"
    - "compressing graphs and indexes with recursive graph bisection"
    - "on the implicit graph conjecture"

Connected through hyperedge HE-8 (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"
    - "a succinct data structure for self indexing ternary relations"
    - "aggregated 2d range queries on clustered points"
    - "navigational rule derivation an algorithm to determine the effect of traffic signs on road networks"

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)