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: "independence of tabulation based hash classes"
  Abstract: A tabulation-based hash function maps a key into d derived characters indexing random values in tables that are then combined with bitwise xor operations to give the hash. Thorup and Zhang (2004) presented d-wise independent tabulation-based hash classes that use linear maps over finite fields to map a key, considered as a vector (a,b), to derived characters. We show that a variant where the derived characters are a+b*i for i=0,..., q-1 (using integer arithmetic) yielding (2d-1)-wise independence. Our analysis is based on an algebraic property that characterizes k-wise independence of tabulation-based hashing schemes, and combines this characterization with a geometric argument. We also prove a non-trivial lower bound on the number of derived characters necessary for k-wise independence with our and related hash classes.

Connected through hyperedge HE-1 (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"
    - "on the insertion time of cuckoo hashing"
    - "tight thresholds for cuckoo hashing via xorsat"

Connected through hyperedge HE-2 (induced by source paper "approximately minwise independence with twisted tabulation"):
  with members:
    - "bottom k and priority sampling set similarity and subset sums with minimal independence"
    - "simple tabulation fast expanders double tabulation and high independence"
    - "on the k independence required by linear probing and minwise independence"

Connected through hyperedge HE-3 (induced by source paper "simple tabulation fast expanders double tabulation and high independence"):
  with members:
    - "the power of simple tabulation hashing"

Connected through hyperedge HE-4 (induced by source paper "explicit and efficient hash families suffice for cuckoo hashing with a stash"):
  with members:
    - "the power of simple tabulation hashing"
    - "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)