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: "wear minimization for cuckoo hashing how not to throw a lot of eggs into one basket"
  Abstract: We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of $\log\log n+O(1)$ after the insertion of $n$ items into a table of size $Cn$ for a suitable constant $C$ using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linear probing in practice.

Connected through hyperedge HE-1 (induced by source paper "parallel write efficient algorithms and data structures for computational geometry"):
  with members:
    - "algorithmic building blocks for asymmetric memories"
    - "parallelism in randomized incremental algorithms"
    - "pam parallel augmented maps"
    - "sorting with asymmetric read and write costs"
    - "efficient algorithms with asymmetric read and write costs"
    - "fast parallel operations on search trees"

Connected through hyperedge HE-2 (induced by source paper "robust set reconciliation via locality sensitive hashing"):
  with members:
    - "reconciling graphs and sets of sets"
    - "parallel peeling algorithms"
    - "simple multi party set reconciliation"
    - "invertible bloom lookup tables"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"

Connected through hyperedge HE-3 (induced by source paper "implicit decomposition for write efficient connectivity algorithms"):
  with members:
    - "sorting with asymmetric read and write costs"
    - "efficient algorithms with asymmetric read and write costs"
    - "parallel graph decompositions using random shifts"

Connected through hyperedge HE-4 (induced by source paper "efficient algorithms with asymmetric read and write costs"):
  with members:
    - "sorting with asymmetric read and write costs"
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"

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)