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: "rethinking serializable multiversion concurrency control"
  Abstract: Multi-versioned database systems have the potential to significantly increase the amount of concurrency in transaction processing because they can avoid read-write conflicts. Unfortunately, the increase in concurrency usually comes at the cost of transaction serializability. If a database user requests full serializability, modern multi-versioned systems significantly constrain read-write concurrency among conflicting transactions and employ expensive synchronization patterns in their design. In main-memory multi-core settings, these additional constraints are so burdensome that multi-versioned systems are often significantly outperformed by single-version systems. #R##N#We propose Bohm, a new concurrency control protocol for main-memory multi-versioned database systems. Bohm guarantees serializable execution while ensuring that reads never block writes. In addition, Bohm does not require reads to perform any book-keeping whatsoever, thereby avoiding the overhead of tracking reads via contended writes to shared memory. This leads to excellent scalability and performance in multi-core settings. Bohm has all the above characteristics without performing validation based concurrency control. Instead, it is pessimistic, and is therefore not prone to excessive aborts in the presence of contention. An experimental evaluation shows that Bohm performs well in both high contention and low contention settings, and is able to dramatically outperform state-of-the-art multi-versioned systems despite maintaining the full set of serializability guarantees.

Connected through hyperedge HE-1 (induced by source paper "a fault tolerance shim for serverless computing"):
  with members:
    - "cloud programming simplified a berkeley view on serverless computing"
    - "serverless computing one step forward two steps back"
    - "occupy the cloud distributed computing for the 99"
    - "serverless computing current trends and open problems"
    - "skew in parallel query processing"

Connected through hyperedge HE-2 (induced by source paper "parblockchain leveraging transaction parallelism in permissioned blockchain systems"):
  with members:
    - "fastfabric scaling hyperledger fabric to 20 000 transactions per second"
    - "trusted multi party computation and verifiable simulations a scalable blockchain approach"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "performance benchmarking and optimizing hyperledger fabric blockchain platform"
    - "blockchains consensus protocols in the wild"
    - "a byzantine fault tolerant ordering service for the hyperledger fabric blockchain platform"
    - "adding concurrency to smart contracts"
    - "dgcc a new dependency graph based concurrency control protocol for multicore database systems"

Connected through hyperedge HE-3 (induced by source paper "livegraph a transactional graph storage system with purely sequential adjacency list scans"):
  with members:
    - "tigergraph a native mpp graph database"
    - "in depth benchmarking of graph database systems with the linked data benchmark council ldbc social network benchmark snb"
    - "weaver a high performance transactional graph database based on refinable timestamps"
    - "graph analytics using the vertica relational database"
    - "high performance concurrency control mechanisms for main memory databases"

Connected through hyperedge HE-4 (induced by source paper "star scaling transactions through asymmetric replication"):
  with members:
    - "obladi oblivious serializable transactions in the cloud"
    - "high performance concurrency control mechanisms for main memory databases"

Connected through hyperedge HE-5 (induced by source paper "a queue oriented transaction processing paradigm"):
  with members:
    - "hyperledger fabric a distributed operating system for permissioned blockchains"

Connected through hyperedge HE-6 (induced by source paper "scaling out acid applications with operation partitioning"):
  with members:
    - "the homeostasis protocol avoiding transaction coordination through program analysis"
    - "elastras an elastic transactional data store in the cloud"

Connected through hyperedge HE-7 (induced by source paper "efficiently making almost any concurrency control mechanism serializable"):
  with members:
    - "serializable snapshot isolation in postgresql"
    - "high performance concurrency control mechanisms for main memory databases"
    - "a critique of ansi sql isolation levels"

Connected through hyperedge HE-8 (induced by source paper "scaling distributed transaction processing and recovery based on dependency logging"):
  with members:
    - "design principles for scaling multi core oltp under high contention"
    - "high performance concurrency control mechanisms for main memory databases"
    - "implementing performance competitive logical recovery"

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.DB(Databases)