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 "distributed triangle counting in the graphulo matrix math library"):
  Abstract: Triangle counting is a key algorithm for large graph analysis. The Graphulo library provides a framework for implementing graph algorithms on the Apache Accumulo distributed database. In this work we adapt two algorithms for counting triangles, one that uses the adjacency matrix and another that also uses the incidence matrix, to the Graphulo library for serverside processing inside Accumulo. Cloud-based experiments show a similar performance profile for these different approaches on the family of power law Graph500 graphs, for which data skew increasingly bottlenecks. These results motivate the design of skew-aware hybrid algorithms that we propose for future work.

Includes members:
  Member "laradb a minimalist kernel for linear and relational algebra computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards scalable dataframe systems")
  Member "static graph challenge subgraph isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "benchmarking the graphulo processing framework":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "d4m 3 0 extended database and language capabilities")
  Member "hypergraph partitioning for sparse matrix matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "pipegen data pipe generator for hybrid analytics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polystore accelerated polystore system for heterogeneous workloads")
  Member "the bigdawg polystore system and architecture":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ai data wrangling with associative arrays")
  Member "exploiting multiple levels of parallelism in sparse matrix matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "from nosql accumulo to newsql graphulo design and utility of graph algorithms inside a bigtable database":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a graphblas approach for subgraph counting")

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)