{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F2UDWCGGB6C4BBJEK7CIBUCUJ3","short_pith_number":"pith:F2UDWCGG","schema_version":"1.0","canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","source":{"kind":"arxiv","id":"1811.04967","version":1},"attestation_state":"computed","paper":{"title":"The Impact of Timestamp Granularity in Optimistic Concurrency Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Barbara Liskov, Eddie Kohler, Hao Bai, Liuba Shrira, Yihe Huang","submitted_at":"2018-11-12T19:15:27Z","abstract_excerpt":"Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high contention levels, OCC is susceptible to frequent aborts, leading to wasted work and degraded performance. Contention managers, mixed optimistic/pessimistic concurrency control algorithms, and novel optimistic-inspired concurrency control algorithms, such as TicToc, aim to address this problem, but these mechanisms introduce sometimes-high overheads of thei"},"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":"1811.04967","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"581bc5afb3b25b0dee294c5ee77e219600afcc6c591e3449ebdf62bd6fce6283","abstract_canon_sha256":"c9f466df2440b34b7091340dde4e6bc6c76556dc876e5bb08a9d0882786763d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.552086Z","signature_b64":"bnCSDsAh5ZRVf/pRkvLp8lbMAuMKayPsrt+r4kWwl02JgkzWwNd2ncu+Xql34DVlpubC2RBUaWTre95lP7GjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","last_reissued_at":"2026-05-18T00:01:01.551513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.551513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Impact of Timestamp Granularity in Optimistic Concurrency Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Barbara Liskov, Eddie Kohler, Hao Bai, Liuba Shrira, Yihe Huang","submitted_at":"2018-11-12T19:15:27Z","abstract_excerpt":"Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high contention levels, OCC is susceptible to frequent aborts, leading to wasted work and degraded performance. Contention managers, mixed optimistic/pessimistic concurrency control algorithms, and novel optimistic-inspired concurrency control algorithms, such as TicToc, aim to address this problem, but these mechanisms introduce sometimes-high overheads of thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04967","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":"1811.04967","created_at":"2026-05-18T00:01:01.551594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04967v1","created_at":"2026-05-18T00:01:01.551594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04967","created_at":"2026-05-18T00:01:01.551594+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2UDWCGGB6C4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2UDWCGGB6C4BBJE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2UDWCGG","created_at":"2026-05-18T12:32:22.470017+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/F2UDWCGGB6C4BBJEK7CIBUCUJ3","json":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3.json","graph_json":"https://pith.science/api/pith-number/F2UDWCGGB6C4BBJEK7CIBUCUJ3/graph.json","events_json":"https://pith.science/api/pith-number/F2UDWCGGB6C4BBJEK7CIBUCUJ3/events.json","paper":"https://pith.science/paper/F2UDWCGG"},"agent_actions":{"view_html":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3","download_json":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3.json","view_paper":"https://pith.science/paper/F2UDWCGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04967&json=true","fetch_graph":"https://pith.science/api/pith-number/F2UDWCGGB6C4BBJEK7CIBUCUJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/F2UDWCGGB6C4BBJEK7CIBUCUJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/action/storage_attestation","attest_author":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/action/author_attestation","sign_citation":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/action/citation_signature","submit_replication":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/action/replication_record"}},"created_at":"2026-05-18T00:01:01.551594+00:00","updated_at":"2026-05-18T00:01:01.551594+00:00"}