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 "thaad efficient matching queries under temporal abstraction for anomaly detection"):
  Abstract: In this paper we present a novel algorithm and efficient data structure for anomaly detection based on temporal data. Time-series data are represented by a sequence of symbolic time intervals, describing increasing and decreasing trends, in a compact way using gradient temporal abstraction technique. Then we identify unusual subsequences in the resulting sequence using dynamic data structure based on the geometric observations supporting polylogarithmic update and query times. Moreover, we in-troduce a new parameter to control the pairwise difference between the corresponding symbols in addi-tion to a distance metric between the subsequences. Experimental results on a public DNS network traffic dataset show the superiority of our approach compared to the baselines.

Includes members:
  Member "euclidean tsp motorcycle graphs and other new applications of nearest neighbor chains":
    also connected through other hyperedges:
      (none)
  Member "dynamic geometric data structures via shallow cuttings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reactive proximity data structures for graphs")
  Member "a survey on learning to hash":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on deep hashing methods")
  Member "dynamic planar voronoi diagrams for general distance functions and their algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a graph theoretic additive approximation of optimal transport")

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)