{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RSXHJAJWUIOUFRJYZ7UE5YGD4Q","short_pith_number":"pith:RSXHJAJW","schema_version":"1.0","canonical_sha256":"8cae748136a21d42c538cfe84ee0c3e43c32401f5935d7170cb7fb420ea80b29","source":{"kind":"arxiv","id":"1805.11453","version":3},"attestation_state":"computed","paper":{"title":"Technical Report: Optimistic Execution in Key-Value Store","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksey Charapko, Duong Nguyen, Murat Demirbas, Sandeep Kulkarni","submitted_at":"2018-05-25T23:19:24Z","abstract_excerpt":"Limitations of the CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system design. We focus on the problem of what a designer should do if he/she has an algorithm that works correctly with sequential consistency but is faced with an underlying key-value store that provides a weaker (e.g., eventual or causal) consistency. We propose a detect-rollback based approach: The designer identifies a correctness predicate, say $P$, and continues to run the protocol, as our syst"},"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":"1805.11453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-25T23:19:24Z","cross_cats_sorted":[],"title_canon_sha256":"17c0f0b4edb8115ed5371c3864acdcb62c27efad15389747d112ed7fc26fa6f2","abstract_canon_sha256":"653fc093d119399f82796f3153ed8d801aecc137d962be399251e62abefba88c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:31.596086Z","signature_b64":"1CSe3S7v5Q57kgFvZP1IKldsI6nbO24+rTi6AvhKJS81eFJhG4hXjAkNJQC9A0j59WyZWN9G9RBJppWJu+BPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cae748136a21d42c538cfe84ee0c3e43c32401f5935d7170cb7fb420ea80b29","last_reissued_at":"2026-05-18T00:12:31.595415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:31.595415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Report: Optimistic Execution in Key-Value Store","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aleksey Charapko, Duong Nguyen, Murat Demirbas, Sandeep Kulkarni","submitted_at":"2018-05-25T23:19:24Z","abstract_excerpt":"Limitations of the CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system design. We focus on the problem of what a designer should do if he/she has an algorithm that works correctly with sequential consistency but is faced with an underlying key-value store that provides a weaker (e.g., eventual or causal) consistency. We propose a detect-rollback based approach: The designer identifies a correctness predicate, say $P$, and continues to run the protocol, as our syst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11453","kind":"arxiv","version":3},"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":"1805.11453","created_at":"2026-05-18T00:12:31.595523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11453v3","created_at":"2026-05-18T00:12:31.595523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11453","created_at":"2026-05-18T00:12:31.595523+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSXHJAJWUIOU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSXHJAJWUIOUFRJY","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSXHJAJW","created_at":"2026-05-18T12:32:50.500415+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/RSXHJAJWUIOUFRJYZ7UE5YGD4Q","json":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q.json","graph_json":"https://pith.science/api/pith-number/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/graph.json","events_json":"https://pith.science/api/pith-number/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/events.json","paper":"https://pith.science/paper/RSXHJAJW"},"agent_actions":{"view_html":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q","download_json":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q.json","view_paper":"https://pith.science/paper/RSXHJAJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11453&json=true","fetch_graph":"https://pith.science/api/pith-number/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/action/storage_attestation","attest_author":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/action/author_attestation","sign_citation":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/action/citation_signature","submit_replication":"https://pith.science/pith/RSXHJAJWUIOUFRJYZ7UE5YGD4Q/action/replication_record"}},"created_at":"2026-05-18T00:12:31.595523+00:00","updated_at":"2026-05-18T00:12:31.595523+00:00"}