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: "on the insertion time of random walk cuckoo hashing"
  Abstract: Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler. It uses $d\geq 2$ distinct hash functions to insert items into the hash table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items. We show that if the number of hash functions $d=O(1)$ is sufficiently large, then the expected insertion time is $O(1)$ per item.

Connected through hyperedge HE-1 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures"):
  with members:
    - "dense peelable random uniform hypergraphs"
    - "fast scalable construction of minimal perfect hash functions"
    - "bubing massive crawling for the masses"
    - "the multiple orientability thresholds for random hypergraphs"
    - "high speed hashing for integers and strings"
    - "cache oblivious peeling of random hypergraphs"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"

Connected through hyperedge HE-2 (induced by source paper "load thresholds for cuckoo hashing with overlapping blocks"):
  with members:
    - "the multiple orientability thresholds for random hypergraphs"
    - "a cuckoo hashing variant with improved memory utilization and insertion time"
    - "sharp load thresholds for cuckoo hashing"
    - "tight thresholds for cuckoo hashing via xorsat"

Connected through hyperedge HE-3 (induced by source paper "balanced allocation through random walk"):
  with members:
    - "on the insertion time of cuckoo hashing"

Connected through hyperedge HE-4 (induced by source paper "consistent hashing with bounded loads"):
  with members:
    - "balanced allocations a simple proof for the heavily loaded case"
    - "on the insertion time of cuckoo hashing"

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)