human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "layering data structures over skip graphs for increased numa locality"):
  Abstract: We describe an approach for blackbox concurrency based on layering user-provided, sequential data structures over concurrent skip graph variants for increased NUMA locality. We implement sets, maps, and priority queues, although our approach is potentially applicable for other data types. Threads operate privately on the top sequential data structures, used to jump to positions in the bottom concurrent skip graph, near to where insertions and removals take place, reducing remote memory accesses. A careful data structure partition scheme ensures the increase of data locality. We implemented our strategy in C++14, and our sets and maps run up to 23% faster than a highly-optimized concurrent skip list (our fastest contender), with up to 70% of reduction on the number of remote synchronized reads, and up to a 3.21 times increase in the CAS locality for 32 threads.

Includes members:
  Member "global local view scalable consistency for concurrent data types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using skip graphs for increased numa locality")
  Member "the lock free k lsm relaxed priority queue":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "the adaptive priority queue with elimination and combining":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using skip graphs for increased numa locality")

Question: Please tell me which class the source paper 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)