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 "answering spatial multiple set intersection queries using 2 3 cuckoo hash filters"):
  Abstract: We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t sets involved in the query, w is the number of bits in a memory word, k is the output size, and c is any fixed constant. This improves the asymptotic performance over previous solutions and is based on an interesting data structure, known as 2-3 cuckoo hash-filters. Our results apply in the word-RAM model (or practical RAM model), which allows for constant-time bit-parallel operations, such as bitwise AND, OR, NOT, and MSB (most-significant 1-bit), as exist in modern CPUs and GPUs. Our solutions apply to any multiple-set intersection queries in spatial data sets that can be reduced to one-dimensional range queries, such as spatial join queries for one-dimensional points or sets of points stored along space-filling curves, which are used in GIS applications.

Includes members:
  Member "cuckoo filter simplification and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimizing bloom filter challenges solutions and comparisons")
  Member "the input output complexity of triangle enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "dynamic set intersection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the hardness of set disjointness and set intersection with bounded universe")
  Member "thresholds for extreme orientability":
    also connected through other hyperedges:
      (none)
  Member "fast set intersection in memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pam parallel augmented maps")
  Member "a new data layout for set intersection on gpus":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gsi gpu friendly subgraph isomorphism")
  Member "privacy preserving access of outsourced data via oblivious ram simulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for oblivious near neighbor search")
  Member "fast evaluation of union intersection expressions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient data analytics on augmented similarity triplets")

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)