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: "using paxos to build a scalable consistent and highly available datastore"
  Abstract: Spinnaker is an experimental datastore that is designed to run on a large cluster of commodity servers in a single datacenter. It features key-based range partitioning, 3-way replication, and a transactional get-put API with the option to choose either strong or timeline consistency on reads. This paper describes Spinnaker's Paxos-based replication protocol. The use of Paxos ensures that a data partition in Spinnaker will be available for reads and writes as long a majority of its replicas are alive. Unlike traditional master-slave replication, this is true regardless of the failure sequence that occurs. We show that Paxos replication can be competitive with alternatives that provide weaker consistency guarantees. Compared to an eventually consistent datastore, we show that Spinnaker can be as fast or even faster on reads and only 5% to 10% slower on writes.

Connected through hyperedge HE-1 (induced by source paper "wiser a highly available htap dbms for iot applications"):
  with members:
    - "fast failure recovery for main memory dbmss on multicores"

Connected through hyperedge HE-2 (induced by source paper "a survey of challenges for runtime verification from advanced application domains beyond software"):
  with members:
    - "adventures in monitorability from branching to linear time and back again"
    - "after you please browser extensions order attacks and countermeasures"
    - "selective monitoring"
    - "monitoring data minimisation"
    - "on the monitoring of decentralized specifications semantics properties analysis and simulation"
    - "an algebraic framework for runtime verification"
    - "learning to protect communications with adversarial neural cryptography"
    - "a web based tool for analysing normative documents in english"

Connected through hyperedge HE-3 (induced by source paper "acia not acid conditions properties and challenges"):
  with members:
    - "to vote before decide a logless one phase commit protocol for highly available datastores"
    - "incremental consistency guarantees for replicated objects"
    - "serializability not serial concurrency control and availability in multi datacenter datastores"
    - "a critique of ansi sql isolation levels"
    - "consensus on transaction commit"

Connected through hyperedge HE-4 (induced by source paper "optcon an adaptable sla aware consistency tuning framework for quorum based stores"):
  with members:
    - "probabilistically bounded staleness for practical partial quorums"
    - "toward a principled framework for benchmarking consistency"

Connected through hyperedge HE-5 (induced by source paper "consistency in non transactional distributed storage systems"):
  with members:
    - "don t trust the cloud verify integrity and consistency for cloud object stores"
    - "blazes coordination analysis for distributed programs"
    - "probabilistically bounded staleness for practical partial quorums"
    - "toward a principled framework for benchmarking consistency"
    - "fork sequential consistency is blocking"
    - "a unified theory of shared memory consistency"

Connected through hyperedge HE-6 (induced by source paper "adaptive logging for distributed in memory databases"):
  with members:
    - "implementing performance competitive logical recovery"

Connected through hyperedge HE-7 (induced by source paper "stretching multi ring paxos"):
  with members:
    - "building global and scalable systems with atomic multicast"

Connected through hyperedge HE-8 (induced by source paper "building global and scalable systems with atomic multicast"):
  with members:
    - "optimistic parallel state machine replication"
    - "rethinking state machine replication for parallelism"

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)