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: "probabilistically bounded staleness for practical partial quorums"
  Abstract: Data store replication results in a fundamental trade-off between operation latency and data consistency. In this paper, we examine this trade-off in the context of quorum-replicated data stores. Under partial, or non-strict quorum replication, a data store waits for responses from a subset of replicas before answering a query, without guaranteeing that read and write replica sets intersect. As deployed in practice, these configurations provide only basic eventual consistency guarantees, with no limit to the recency of data returned. However, anecdotally, partial quorums are often "good enough" for practitioners given their latency benefits. In this work, we explain why partial quorums are regularly acceptable in practice, analyzing both the staleness of data they return and the latency benefits they offer. We introduce Probabilistically Bounded Staleness (PBS) consistency, which provides expected bounds on staleness with respect to both versions and wall clock time. We derive a closed-form solution for versioned staleness as well as model real-time staleness for representative Dynamo-style systems under internet-scale production workloads. Using PBS, we measure the latency-consistency trade-off for partial quorum systems. We quantitatively demonstrate how eventually consistent systems frequently return consistent data within tens of milliseconds while offering significant latency benefits.

Connected through hyperedge HE-1 (induced by source paper "consistency analysis of replication based probabilistic key value stores"):
  with members:
    - "characterizing and adapting the consistency latency tradeoff in distributed key value stores"

Connected through hyperedge HE-2 (induced by source paper "usability squared principles for doing good systems research in robotics"):
  with members:
    - "experimenting with robotic intra logistics domains"
    - "analysis and observations from the first amazon picking challenge"
    - "building on quicksand"

Connected through hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "storage efficient shared memory emulation"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "correlation aware distributed caching and coded delivery"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "multi version coding an information theoretic perspective of consistent distributed storage"

Connected through hyperedge HE-4 (induced by source paper "minimizing content staleness in dynamo style replicated storage systems"):
  with members:
    - "the power of waiting for more than one response in minimizing the age of information"
    - "timely updates over an erasure channel"
    - "status updates through m g 1 1 queues with harq"
    - "minimizing the age of the information through queues"
    - "update or wait how to keep your data fresh"
    - "characterizing and adapting the consistency latency tradeoff in distributed key value stores"

Connected through hyperedge HE-5 (induced by source paper "a clustering based consistency adaptation strategy for distributed sdn controllers"):
  with members:
    - "incremental clustering the case for extra clusters"

Connected through hyperedge HE-6 (induced by source paper "optcon an adaptable sla aware consistency tuning framework for quorum based stores"):
  with members:
    - "toward a principled framework for benchmarking consistency"
    - "using paxos to build a scalable consistent and highly available datastore"

Connected through hyperedge HE-7 (induced by source paper "incremental consistency guarantees for replicated objects"):
  with members:
    - "building on quicksand"

Connected through hyperedge HE-8 (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"
    - "toward a principled framework for benchmarking consistency"
    - "using paxos to build a scalable consistent and highly available datastore"
    - "fork sequential consistency is blocking"
    - "a unified theory of shared memory consistency"

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)