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 "fully dynamic space efficient dictionaries and filters with constant number of memory accesses"):
  Abstract: A fully-dynamic dictionary is a data structure for maintaining sets that supports insertions, deletions and membership queries. A filter approximates membership queries with a one-sided error. We present two designs: #R##N#1. The first space-efficient fully-dynamic dictionary that maintains both sets and random multisets and supports queries, insertions, and deletions with a constant number of memory accesses in the worst case with high probability. The comparable dictionary of Arbitman, Naor, and Segev [FOCS 2010] works only for sets. #R##N#2. By a reduction from our dictionary for random multisets, we obtain a space-efficient fully-dynamic filter that supports queries, insertions, and deletions with a constant number of memory accesses in the worst case with high probability (as long as the false positive probability is $2^{-O(w)}$, where $w$ denotes the word length). This is the first in-memory space-efficient fully-dynamic filter design that provably achieves these properties. #R##N#We also present an application of the techniques used to design our dictionary to the static Retrieval Problem.

Includes members:
  Member "bloom filters adaptivity and the dictionary problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive cuckoo filters")
  Member "adaptive cuckoo filters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a model for learned bloom filters and optimizing by sandwiching")
  Member "fast scalable construction of minimal perfect hash functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "dynamic integer sets with optimal rank select and predecessor search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "o log log n worst case local decoding and update efficiency for data compression")
  Member "how to approximate a set without knowing its size in advance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bloom filters in adversarial environments")
  Member "don t thrash how to cache your hash on flash":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lsm based storage techniques a survey")
  Member "the power of simple tabulation hashing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "backyard cuckoo hashing constant worst case operations with a succinct representation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bloom filters adaptivity and the dictionary problem")

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)