{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PXMES3SIOCS34TVEJYILO2XMX4","short_pith_number":"pith:PXMES3SI","schema_version":"1.0","canonical_sha256":"7dd8496e4870a5be4ea44e10b76aecbf033448f2ae70db2870a88b9138d7805e","source":{"kind":"arxiv","id":"1509.02464","version":2},"attestation_state":"computed","paper":{"title":"Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-value Stores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Indranil Gupta, Lewis Tseng, Muntasir Raihan Rahman, Nitin Vaidya, Son Nguyen","submitted_at":"2015-09-08T17:46:29Z","abstract_excerpt":"The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first present and prove two CAP-like impossibility theorems. To state these theorems, we present probabilistic models to characterize the three important elements of the CAP theorem: consistency (C), availability or latency (A), and partition tolerance (P). The theorems show the un-achievable envelope, i.e., which combinations of the parameters of the three models make them impossible to achieve together. Next, we present the design of a class of systems called PCAP that perform close to the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.02464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-08T17:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"98b08f469a078505983dab9aa8cf0dcbe255d5cc1171008e1da8a71930342c33","abstract_canon_sha256":"fb1ab418baf4ac8a2783e994f927fc55f7b46a5644409bff72d24c7dd68d5d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:06.100445Z","signature_b64":"9u/bfi9Yzv2gwiAi3dyjScAfbApy+Lm2fvoofnIMK56THdHUsVK/8nCSm0UcJtt9NyZ5TTxeSweBHKsIhw4cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dd8496e4870a5be4ea44e10b76aecbf033448f2ae70db2870a88b9138d7805e","last_reissued_at":"2026-05-18T01:22:06.099954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:06.099954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-value Stores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Indranil Gupta, Lewis Tseng, Muntasir Raihan Rahman, Nitin Vaidya, Son Nguyen","submitted_at":"2015-09-08T17:46:29Z","abstract_excerpt":"The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first present and prove two CAP-like impossibility theorems. To state these theorems, we present probabilistic models to characterize the three important elements of the CAP theorem: consistency (C), availability or latency (A), and partition tolerance (P). The theorems show the un-achievable envelope, i.e., which combinations of the parameters of the three models make them impossible to achieve together. Next, we present the design of a class of systems called PCAP that perform close to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02464","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.02464","created_at":"2026-05-18T01:22:06.100027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02464v2","created_at":"2026-05-18T01:22:06.100027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02464","created_at":"2026-05-18T01:22:06.100027+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXMES3SIOCS3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXMES3SIOCS34TVE","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXMES3SI","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4","json":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4.json","graph_json":"https://pith.science/api/pith-number/PXMES3SIOCS34TVEJYILO2XMX4/graph.json","events_json":"https://pith.science/api/pith-number/PXMES3SIOCS34TVEJYILO2XMX4/events.json","paper":"https://pith.science/paper/PXMES3SI"},"agent_actions":{"view_html":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4","download_json":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4.json","view_paper":"https://pith.science/paper/PXMES3SI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02464&json=true","fetch_graph":"https://pith.science/api/pith-number/PXMES3SIOCS34TVEJYILO2XMX4/graph.json","fetch_events":"https://pith.science/api/pith-number/PXMES3SIOCS34TVEJYILO2XMX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4/action/storage_attestation","attest_author":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4/action/author_attestation","sign_citation":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4/action/citation_signature","submit_replication":"https://pith.science/pith/PXMES3SIOCS34TVEJYILO2XMX4/action/replication_record"}},"created_at":"2026-05-18T01:22:06.100027+00:00","updated_at":"2026-05-18T01:22:06.100027+00:00"}