human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "de amortized cuckoo hashing provable worst case performance and experimental results"
  Abstract: Cuckoo hashing is a highly practical dynamic dictionary: it provides amortized constant insertion time, worst case constant deletion time and lookup time, and good memory utilization. However, with a noticeable probability during the insertion of n elements some insertion requires \Omega(log n) time. Whereas such an amortized guarantee may be suitable for some applications, in other applications (such as high-performance routing) this is highly undesirable. #R##N#Recently, Kirsch and Mitzenmacher (Allerton '07) proposed a de-amortization of cuckoo hashing using various queueing techniques that preserve its attractive properties. Kirsch and Mitzenmacher demonstrated a significant improvement to the worst case performance of cuckoo hashing via experimental results, but they left open the problem of constructing a scheme with provable properties. #R##N#In this work we follow Kirsch and Mitzenmacher and present a de-amortization of cuckoo hashing that provably guarantees constant worst case operations. Specifically, for any sequence of polynomially many operations, with overwhelming probability over the randomness of the initialization phase, each operation is performed in constant time. Our theoretical analysis and experimental results indicate that the scheme is highly efficient, and provides a practical alternative to the only other known dynamic dictionary with such worst case guarantees, due to Dietzfelbinger and Meyer auf der Heide (ICALP '90).

Connected through hyperedge HE-1 (induced by source paper "fully dynamic space efficient dictionaries and filters with constant number of memory accesses"):
  with members:
    - "bloom filters adaptivity and the dictionary problem"
    - "adaptive cuckoo filters"
    - "fast scalable construction of minimal perfect hash functions"
    - "dynamic integer sets with optimal rank select and predecessor search"
    - "how to approximate a set without knowing its size in advance"
    - "don t thrash how to cache your hash on flash"
    - "the power of simple tabulation hashing"
    - "backyard cuckoo hashing constant worst case operations with a succinct representation"

Connected through hyperedge HE-2 (induced by source paper "a faster algorithm for cuckoo insertion and bipartite matching in large graphs"):
  with members:
    - "a simple hash class with strong randomness properties in graphs and hypergraphs"
    - "on the insertion time of cuckoo hashing"
    - "sharp load thresholds for cuckoo hashing"

Connected through hyperedge HE-3 (induced by source paper "a framework for estimating stream expression cardinalities"):
  with members:
    - "all distances sketches revisited hip estimators for massive graphs analysis"
    - "bottom k and priority sampling set similarity and subset sums with minimal independence"
    - "backyard cuckoo hashing constant worst case operations with a succinct representation"
    - "leveraging discarded samples for tighter estimation of multiple set aggregates"

Connected through hyperedge HE-4 (induced by source paper "wear minimization for cuckoo hashing how not to throw a lot of eggs into one basket"):
  with members:
    - "tight thresholds for cuckoo hashing via xorsat"

Connected through hyperedge HE-5 (induced by source paper "how to approximate a set without knowing its size in advance"):
  with members:
    - "sliding bloom filters"
    - "backyard cuckoo hashing constant worst case operations with a succinct representation"
    - "succinct data structures for retrieval and approximate membership"
    - "an optimal bloom filter replacement based on matrix solving"

Connected through hyperedge HE-6 (induced by source paper "the power of deferral maintaining a constant competitive steiner tree online"):
  with members:
    - "buyback problem approximate matroid intersection with cancellation costs"

Connected through hyperedge HE-7 (induced by source paper "fully de amortized cuckoo hashing for cache oblivious dictionaries and multimaps"):
  with members:
    - "external memory multimaps"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "backyard cuckoo hashing constant worst case operations with a succinct representation"

Connected through hyperedge HE-8 (induced by source paper "oblivious storage with low i o overhead"):
  with members:
    - "oblivious ram simulation with efficient worst case access overhead"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "privacy preserving access of outsourced data via oblivious ram simulation"

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