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 transactional systems cannot be fast"):
  Abstract: We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions that write more than one object. We prove this impossibility result for distributed storage systems that are causally consistent, i.e., they do not require to ensure any strong form of consistency. Therefore, our result holds also for any system that ensures a consistency level stronger than causal consistency, e.g., strict serializability. The impossibility result holds even for systems that store only two objects (and support at least two servers and at least four clients). It also holds for systems that are partially replicated. Our result justifies the design choices of state-of-the-art distributed transactional systems and insists that system designers should not put more effort to design fully-functional systems that support both fast read transactions and ensure causal or any stronger form of consistency.

Includes members:
  Member "paris causally consistent transactions with non blocking reads and partial replication":
    also connected through other hyperedges:
      (none)
  Member "distributed transactional reads the strong the quick the fresh the impossible":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "paris causally consistent transactions with non blocking reads and partial replication")
  Member "size aware sharding for improving tail latencies in in memory key value stores":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinicache exploiting ephemeral serverless functions to build a cost effective memory cache")
  Member "causal consistency and latency optimality friend or foe":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "paris causally consistent transactions with non blocking reads and partial replication")
  Member "yesquel scalable sql storage for web applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "safe serializable secure scheduling transactions and the trade off between security and consistency")
  Member "a critique of ansi sql isolation levels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cloudburst stateful functions as a service")

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)