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: "tight thresholds for cuckoo hashing via xorsat"
  Abstract: We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key. Each key has k >= 3 (distinct) associated buckets chosen uniformly at random and independently of the choices of other keys. A hash table can be constructed successfully if each key can be placed into one of its buckets. We seek thresholds alpha_k such that, as n goes to infinity, if n/m  = alpha for some alpha > alpha_k a hash table cannot be constructed successfully with high probability. Here we are considering the offline version of the problem, where all keys and hash values are given, so the problem is equivalent to previous models of multiple-choice hashing. We find the thresholds for all values of k > 2 by showing that they are in fact the same as the previously known thresholds for the random k-XORSAT problem. We then extend these results to the setting where keys can have differing number of choices, and provide evidence in the form of an algorithm for a conjecture extending this result to cuckoo hash tables that store multiple keys in a bucket.

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"
    - "on the insertion time of random walk cuckoo hashing"
    - "high speed hashing for integers and strings"
    - "cache oblivious peeling of random hypergraphs"
    - "thresholds of spatially coupled systems via lyapunov s method"

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"
    - "on the insertion time of random walk cuckoo hashing"
    - "a cuckoo hashing variant with improved memory utilization and insertion time"
    - "sharp load thresholds for cuckoo hashing"

Connected through hyperedge HE-3 (induced by source paper "arithmetic progression hypergraphs examining the second moment method"):
  with members:
    - "more analysis of double hashing for balanced allocations"
    - "balanced allocations and double hashing"
    - "catching the k naesat threshold"

Connected through hyperedge HE-4 (induced by source paper "emoma exact match in one memory access"):
  with members:
    - "bloomier filters a second look"

Connected through hyperedge HE-5 (induced by source paper "a simple hash class with strong randomness properties in graphs and hypergraphs"):
  with members:
    - "from independence to expansion and back again"
    - "approximately minwise independence with twisted tabulation"
    - "parallel peeling algorithms"
    - "simple tabulation fast expanders double tabulation and high independence"
    - "on the k independence required by linear probing and minwise independence"
    - "independence of tabulation based hash classes"
    - "on the insertion time of cuckoo hashing"

Connected through hyperedge HE-6 (induced by source paper "fast scalable construction of minimal perfect hash functions"):
  with members:
    - "fast prefix search in little space with applications"
    - "bubing massive crawling for the masses"
    - "cache oblivious peeling of random hypergraphs"
    - "satisfiability thresholds beyond k xorsat"
    - "sharp load thresholds for cuckoo hashing"

Connected through hyperedge HE-7 (induced by source paper "the multiple orientability thresholds for random hypergraphs"):
  with members:
    - "sharp load thresholds for cuckoo hashing"

Connected through hyperedge HE-8 (induced by source paper "inside the clustering window for random linear equations"):
  with members:
    - "on independent sets in random graphs"
    - "the set of solutions of random xorsat formulae"
    - "chasing the k colorability threshold"
    - "catching the k naesat threshold"
    - "frozen variables in random boolean constraint satisfaction problems"
    - "the solution space geometry of random linear equations"
    - "reconstruction and clustering in random constraint satisfaction problems"
    - "survey propagation an algorithm for satisfiability"

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)