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 "finding temporal patterns using algebraic fingerprints"):
  Abstract: In this paper we study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multi-set of colors as a query, we search for temporal paths in the graph that contain the colors specified in the query. These types of problems have several interesting applications, for example, recommending tours for tourists, or searching for abnormal behavior in a network of financial transactions. For the family of pattern-detection problems we define, we establish complexity results and design an algebraic-algorithmic framework based on constrained multilinear sieving. We demonstrate that our solution can scale to massive graphs with up to hundred million edges, despite the problems being NP-hard. Our implementation, which is publicly available, exhibits practical edge-linear scalability and highly optimized. For example, in a real-world graph dataset with more than six million edges and a multi-set query with ten colors, we can extract an optimal solution in less than eight minutes on a haswell desktop with four cores.

Includes members:
  Member "approximately counting and sampling small witnesses using a colourful decision oracle":
    also connected through other hyperedges:
      (none)
  Member "the computational complexity of finding temporal paths under waiting time constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient computation of optimal temporal walks under waiting time constraints")
  Member "motivo fast motif counting via succinct color coding and adaptive sampling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "mining frequent patterns in evolving graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "motifs in temporal networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "a motif based approach for identifying controversy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a kernel of truth determining rumor veracity on twitter by diffusion pattern alone")
  Member "stream graphs and link streams for the modeling of interactions over time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "edge disjoint branchings in temporal graphs")
  Member "higher order organization of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")

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)