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: "faster 64 bit universal hashing using carry less multiplications"
  Abstract: Intel and AMD support the carry-less multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH). We compare this new family with what might be the fastest almost universal family on x64 processors (VHASH). We find that CLHASH is at least 60 % faster. We also compare CLHASH with a popular hash function designed for speed (Google’s CityHash). We find that CLHASH is 40 % faster than CityHash on inputs larger than 64 bytes and just as fast otherwise.

Connected through hyperedge HE-1 (induced by source paper "fast hashing with strong concentration bounds"):
  with members:
    - "optimal streaming and tracking distinct elements with high probability"
    - "pseudorandomness via the discrete fourier transform"
    - "high speed hashing for integers and strings"
    - "from independence to expansion and back again"
    - "generating k independent variables in constant time"
    - "hashing for statistics over k partitions"
    - "bottom k and priority sampling set similarity and subset sums with minimal independence"
    - "simple tabulation fast expanders double tabulation and high independence"

Connected through hyperedge HE-2 (induced by source paper "parsing gigabytes of json per second"):
  with members:
    - "faster base64 encoding and decoding using avx2 instructions"

Connected through hyperedge HE-3 (induced by source paper "multiplying boolean polynomials with frobenius partitions in additive fast fourier transform"):
  with members:
    - "novel polynomial basis and its application to reed solomon erasure codes"

Connected through hyperedge HE-4 (induced by source paper "practical evaluation of lempel ziv 78 and lempel ziv welch tries"):
  with members:
    - "dynamic space efficient hashing"
    - "compression with the tudocomp framework"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "range predecessor and lempel ziv parsing"
    - "lempel ziv computation in compressed space lz cics"
    - "alphabet dependent string searching with wexponential search trees"
    - "lightweight lempel ziv parsing"
    - "lz compressed string dictionaries"

Connected through hyperedge HE-5 (induced by source paper "adaptive cuckoo filters"):
  with members:
    - "bloom filters adaptivity and the dictionary problem"

Connected through hyperedge HE-6 (induced by source paper "regular and almost universal hashing an efficient implementation"):
  with members:
    - "high speed hashing for integers and strings"
    - "strongly universal string hashing is fast"
    - "the universality of iterated hashing over variable length strings"
    - "recursive n gram hashing is pairwise independent at best"

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)