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: "a dynamic hash table for the gpu"
  Abstract: We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing strategy that reduces branch divergence and provides an efficient alternative to the traditional way of per-thread (or per-warp) work assignment and processing. By using this strategy, we build a dynamic non-blocking concurrent linked list, the slab list, that supports asynchronous, concurrent updates (insertions and deletions) as well as search queries. We use the slab list to implement a dynamic hash table with chaining (the slab hash). On an NVIDIA Tesla K40c GPU, the slab hash performs updates with up to 512 M updates/s and processes search queries with up to 937 M queries/s. We also design a warp-synchronous dynamic memory allocator, SlabAlloc, that suits the high performance needs of the slab hash. SlabAlloc dynamically allocates memory at a rate of 600 M allocations/s, which is up to 37x faster than alternative methods in similar scenarios.

Connected through hyperedge HE-1 (induced by source paper "slamcast large scale real time 3d reconstruction and streaming for immersive multi client live telepresence"):
  with members:
    - "collaborative large scale dense 3d reconstruction with online inter agent pose optimisation"
    - "viewport adaptive navigable 360 degree video delivery"
    - "adaptive 360 vr video streaming divide and conquer"
    - "bundlefusion real time globally consistent 3d reconstruction using on the fly surface re integration"

Connected through hyperedge HE-2 (induced by source paper "parallel data distribution management on shared memory multiprocessors"):
  with members:
    - "new trends in parallel and distributed simulation from many cores to cloud computing"
    - "a parallel data distribution management algorithm"
    - "hitting the memory wall implications of the obvious"

Connected through hyperedge HE-3 (induced by source paper "hashgraph scalable hash tables using a sparse graph data structure"):
  with members:
    - "concurrent hash tables fast and general"

Connected through hyperedge HE-4 (induced by source paper "speeding up the verification phase of set similarity joins in the gpgpu paradigm"):
  with members:
    - "flash randomized algorithms accelerated over cpu gpu for ultra high dimensional similarity search"
    - "billion scale similarity search with gpus"
    - "efficient large scale approximate nearest neighbor search on the gpu"
    - "a generic inverted index framework for similarity search on the gpu technical report"
    - "v smart join a scalable mapreduce framework for all pair similarity joins of multisets and vectors"

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.DC(Distributed, Parallel, and Cluster Computing)