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 "weaver a high performance transactional graph database based on refinable timestamps"):
  Abstract: Graph databases have become a common infrastructure component. Yet existing systems either operate on offline snapshots, provide weak consistency guarantees, or use expensive concurrency control techniques that limit performance.#R##N##R##N#In this paper, we introduce a new distributed graph database, called Weaver, which enables efficient, transactional graph analyses as well as strictly serializable ACID transactions on dynamic graphs. The key insight that allows Weaver to combine strict serializability with horizontal scalability and high performance is a novel request ordering mechanism called refinable timestamps. This technique couples coarse-grained vector timestamps with a fine-grained timeline oracle to pay the overhead of strong consistency only when needed. Experiments show that Weaver enables a Bitcoin blockchain explorer that is 8x faster than Blockchain.info, and achieves 10.9x higher throughput than the Titan graph database on social network workloads and 4x lower latency than GraphLab on offline graph traversal workloads.

Includes members:
  Member "effective techniques for message reduction and load balancing in distributed graph computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph3s a simple speedy and scalable distributed graph processing system")
  Member "warp lightweight multi key transactions for key value stores":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a comprehensive evaluation of rdma enabled concurrency control protocols")
  Member "robobrain large scale knowledge engine for robots":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "designing interaction for multi agent cooperative system in an office environment")
  Member "pregelix big ger graph analytics on a dataflow engine":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph3s a simple speedy and scalable distributed graph processing system")
  Member "graphchi db simple design for a scalable graph database system on just a pc":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on methods and systems for graph compression")
  Member "rethinking serializable multiversion concurrency control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a fault tolerance shim for serverless computing")
  Member "the anatomy of the facebook social graph":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph bert only attention is needed for learning graph representations")

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)