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: "gract a grammar based compressed representation of trajectories"
  Abstract: Much research has been published about trajectory management on the ground or at the sea, but compression or indexing of flight trajectories have usually been less explored. However, air traffic management is a challenge because airspace is becoming more and more congested, and large flight data collections must be preserved and exploited for varied purposes. This paper proposes 3DGraCT, a new method for representing these flight trajectories. It extends the GraCT compact data structure to cope with a third dimension (altitude), while retaining its space/time complexities. 3DGraCT improves space requirements of traditional spatio-temporal data structures by two orders of magnitude, being competitive for the considered types of queries, even leading the comparison for a particular one.

Connected through hyperedge HE-1 (induced by source paper "gract a grammar based compressed index for trajectory data"):
  with members:
    - "one pass error bounded trajectory simplification"
    - "queries on lz bounded encodings"
    - "press a novel framework of trajectory compression in road networks"
    - "from theory to practice plug and play with succinct data structures"
    - "succinct representations of permutations and functions"

Connected through hyperedge HE-2 (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"
    - "a succinct data structure for self indexing ternary relations"
    - "aggregated 2d range queries on clustered points"

Connected through hyperedge HE-3 (induced by source paper "faster and smaller two level index for network based trajectories"):
  with members:
    - "cinct compression and retrieval for massive vehicular trajectories via relative movement labeling"
    - "efficient compression and indexing of trajectories"
    - "compact trip representation over networks"
    - "composite repetition aware data structures"
    - "from theory to practice plug and play with succinct data structures"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-4 (induced by source paper "a grammar based compressed representation of 3d trajectories"):
  with members:
    - "from theory to practice plug and play with succinct data structures"

Connected through hyperedge HE-5 (induced by source paper "efficient compression and indexing of trajectories"):
  with members:
    - "from theory to practice plug and play with succinct data structures"
    - "practical entropy compressed rank select dictionary"

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)