human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "using compressed suffix arrays for a compact representation of temporal graphs"):
  Abstract: Abstract   Temporal graphs represent binary relationships that change along time. They can model the dynamism of, for example, social and communication networks. Temporal graphs are defined as sets of contacts that are edges tagged with the temporal intervals when they are active. This work explores the use of the Compressed Suffix Array (CSA), a well-known compact and self-indexed data structure in the area of text indexing, to represent large temporal graphs. The new structure, called Temporal Graph CSA (TGCSA), is experimentally compared with the most competitive compact data structures in the state-of-the-art, namely, EdgeLog and CET. The experimental results show that TGCSA obtains a good space-time trade-off. It uses a reasonable space and is efficient for solving complex temporal queries. Furthermore, TGCSA has wider expressive capabilities than EdgeLog and CET, because it is able to represent temporal graphs where contacts on an edge can temporally overlap.

Includes members:
  Member "action2activity recognizing complex activities from sensor data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "local directional relation pattern for unconstrained and robust face retrieval")
  Member "compact trip representation over networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "about birds project bioinformatics and information retrieval data structures analysis and design")
  Member "an introduction to temporal graphs an algorithmic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph generators state of the art and open challenges")
  Member "exploring the structure and function of temporal networks with dynamic graphlets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "item independent temporal motifs to summarize and compare temporal networks")
  Member "windows into relational events data structures for contiguous subsequences of edges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "windows into geometric events data structures for time windowed querying of temporal point sets")
  Member "efficient snapshot retrieval over historical graph data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "path query data structures in practice")

Question: Please tell me which class the source paper 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)