{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:27HIWEZM5SQR7VCN7TSAZKEVQA","short_pith_number":"pith:27HIWEZM","schema_version":"1.0","canonical_sha256":"d7ce8b132ceca11fd44dfce40ca895800aafd3e00eb196d1c13202cda9d7c94e","source":{"kind":"arxiv","id":"1610.07459","version":1},"attestation_state":"computed","paper":{"title":"Optimistic Aborts for Geo-distributed Transactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fernando Pedone, Huynh Tu Dang, Leandro Pacheco de Sousa, Robert Soul\\'e, Theo Jepsen","submitted_at":"2016-10-24T15:35:09Z","abstract_excerpt":"Network latency can have a significant impact on the performance of transactional storage systems, particularly in wide area or geo-distributed deployments. To reduce latency, systems typically rely on a cache to service read-requests closer to the client. However, caches are not effective for write-heavy workloads, which have to be processed by the storage system in order to maintain serializability.\n  This paper presents a new technique, called optimistic abort, which reduces network latency for high-contention, write-heavy workloads by identifying transactions that will abort as early as po"},"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":"1610.07459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-24T15:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"a7b0b61ae1260e710d4ed3fc5893f03b013f8cdf2d79b5897aa38db0280d07b7","abstract_canon_sha256":"36917c0db02dbac4b9ac7bf22b500a8d6babc7a9c906f1fa18624ce933d13f7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.058701Z","signature_b64":"6zIYhQ0T+zQuORcw9GQAG9crvdgp3BUiQ1W7iDHUJCo/iQREQBIzkafh0D0SO1TR+LTrA6xbZ8thcrlInupECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7ce8b132ceca11fd44dfce40ca895800aafd3e00eb196d1c13202cda9d7c94e","last_reissued_at":"2026-05-18T01:01:30.058064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.058064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimistic Aborts for Geo-distributed Transactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fernando Pedone, Huynh Tu Dang, Leandro Pacheco de Sousa, Robert Soul\\'e, Theo Jepsen","submitted_at":"2016-10-24T15:35:09Z","abstract_excerpt":"Network latency can have a significant impact on the performance of transactional storage systems, particularly in wide area or geo-distributed deployments. To reduce latency, systems typically rely on a cache to service read-requests closer to the client. However, caches are not effective for write-heavy workloads, which have to be processed by the storage system in order to maintain serializability.\n  This paper presents a new technique, called optimistic abort, which reduces network latency for high-contention, write-heavy workloads by identifying transactions that will abort as early as po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07459","kind":"arxiv","version":1},"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":"1610.07459","created_at":"2026-05-18T01:01:30.058184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07459v1","created_at":"2026-05-18T01:01:30.058184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07459","created_at":"2026-05-18T01:01:30.058184+00:00"},{"alias_kind":"pith_short_12","alias_value":"27HIWEZM5SQR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"27HIWEZM5SQR7VCN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"27HIWEZM","created_at":"2026-05-18T12:29:52.810259+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/27HIWEZM5SQR7VCN7TSAZKEVQA","json":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA.json","graph_json":"https://pith.science/api/pith-number/27HIWEZM5SQR7VCN7TSAZKEVQA/graph.json","events_json":"https://pith.science/api/pith-number/27HIWEZM5SQR7VCN7TSAZKEVQA/events.json","paper":"https://pith.science/paper/27HIWEZM"},"agent_actions":{"view_html":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA","download_json":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA.json","view_paper":"https://pith.science/paper/27HIWEZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07459&json=true","fetch_graph":"https://pith.science/api/pith-number/27HIWEZM5SQR7VCN7TSAZKEVQA/graph.json","fetch_events":"https://pith.science/api/pith-number/27HIWEZM5SQR7VCN7TSAZKEVQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA/action/storage_attestation","attest_author":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA/action/author_attestation","sign_citation":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA/action/citation_signature","submit_replication":"https://pith.science/pith/27HIWEZM5SQR7VCN7TSAZKEVQA/action/replication_record"}},"created_at":"2026-05-18T01:01:30.058184+00:00","updated_at":"2026-05-18T01:01:30.058184+00:00"}