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: "warp lightweight multi key transactions for key value stores"
  Abstract: Traditional NoSQL systems scale by sharding data across multiple servers and by performing each operation on a small number of servers. Because transactions on multiple keys necessarily require coordination across multiple servers, NoSQL systems often explicitly avoid making transactional guarantees in order to avoid such coordination. Past work on transactional systems control this coordination by either increasing the granularity at which transactions are ordered, sacrificing serializability, or by making clock synchronicity assumptions. #R##N#This paper presents a novel protocol for providing serializable transactions on top of a sharded data store. Called acyclic transactions, this protocol allows multiple transactions to prepare and commit simultaneously, improving concurrency in the system, while ensuring that no cycles form between concurrently-committing transactions. We have fully implemented acyclic transactions in a document store called Warp. Experiments show that Warp achieves 4 times higher throughput than Sinfonia's mini-transactions on the standard TPC-C benchmark with no aborts. Further, the system achieves 75% of the throughput of the non-transactional key-value store it builds upon.

Connected through hyperedge HE-1 (induced by source paper "a comprehensive evaluation of rdma enabled concurrency control protocols"):
  with members:
    - "the homeostasis protocol avoiding transaction coordination through program analysis"

Connected through hyperedge HE-2 (induced by source paper "modeling corruption in eventually consistent graph databases"):
  with members:
    - "taper query aware partition enhancement for large heterogenous graphs"

Connected through hyperedge HE-3 (induced by source paper "reactors a case for predictable virtualized actor database systems"):
  with members:
    - "optimization of imperative programs in a relational database"
    - "transactional partitioning a new abstraction for main memory databases"
    - "design principles for scaling multi core oltp under high contention"
    - "oltp on hardware islands"
    - "elastras an elastic transactional data store in the cloud"

Connected through hyperedge HE-4 (induced by source paper "transactional partitioning a new abstraction for main memory databases"):
  with members:
    - "can the elephants handle the nosql onslaught"

Connected through hyperedge HE-5 (induced by source paper "weaver a high performance transactional graph database based on refinable timestamps"):
  with members:
    - "effective techniques for message reduction and load balancing in distributed graph computation"
    - "robobrain large scale knowledge engine for robots"
    - "pregelix big ger graph analytics on a dataflow engine"
    - "graphchi db simple design for a scalable graph database system on just a pc"
    - "rethinking serializable multiversion concurrency control"
    - "the anatomy of the facebook social graph"

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)