{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QTNLCANWZKM4DAYAWWKPVKQYNN","short_pith_number":"pith:QTNLCANW","schema_version":"1.0","canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","source":{"kind":"arxiv","id":"1810.01997","version":1},"attestation_state":"computed","paper":{"title":"Improving High Contention OLTP Performance via Transaction Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alvin Cheung, Dan Suciu, Guna Prasaad","submitted_at":"2018-10-03T22:53:29Z","abstract_excerpt":"Research in transaction processing has made significant progress in improving the performance of multi-core in-memory transactional systems. However, the focus has mainly been on low-contention workloads. Modern transactional systems perform poorly on workloads with transactions accessing a few highly contended data items. We observe that most transactional workloads, including those with high contention, can be divided into clusters of data conflict-free transactions and a small set of residuals. In this paper, we introduce a new concurrency control protocol called Strife that leverages the a"},"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":"1810.01997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"346e793ff35bad2ad1b1ceaa066bc3f0e98a299a5230f4202c53970c64b10551","abstract_canon_sha256":"c6fc75f09a95d92662878e849ffff175de08d1b66773c02689d79ade49e78a59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.591513Z","signature_b64":"DxbELKCAU4+g3nEpYPrGqH4uYKJjNvBdC3OJNU2VcMp/uR6Yr4tX09cbzw8nX1wz89C+eMykIovNEXJsTRDuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","last_reissued_at":"2026-05-18T00:04:06.590744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.590744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving High Contention OLTP Performance via Transaction Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alvin Cheung, Dan Suciu, Guna Prasaad","submitted_at":"2018-10-03T22:53:29Z","abstract_excerpt":"Research in transaction processing has made significant progress in improving the performance of multi-core in-memory transactional systems. However, the focus has mainly been on low-contention workloads. Modern transactional systems perform poorly on workloads with transactions accessing a few highly contended data items. We observe that most transactional workloads, including those with high contention, can be divided into clusters of data conflict-free transactions and a small set of residuals. In this paper, we introduce a new concurrency control protocol called Strife that leverages the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01997","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":"1810.01997","created_at":"2026-05-18T00:04:06.590859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01997v1","created_at":"2026-05-18T00:04:06.590859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01997","created_at":"2026-05-18T00:04:06.590859+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTNLCANWZKM4","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTNLCANWZKM4DAYA","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTNLCANW","created_at":"2026-05-18T12:32:46.962924+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/QTNLCANWZKM4DAYAWWKPVKQYNN","json":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN.json","graph_json":"https://pith.science/api/pith-number/QTNLCANWZKM4DAYAWWKPVKQYNN/graph.json","events_json":"https://pith.science/api/pith-number/QTNLCANWZKM4DAYAWWKPVKQYNN/events.json","paper":"https://pith.science/paper/QTNLCANW"},"agent_actions":{"view_html":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN","download_json":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN.json","view_paper":"https://pith.science/paper/QTNLCANW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/QTNLCANWZKM4DAYAWWKPVKQYNN/graph.json","fetch_events":"https://pith.science/api/pith-number/QTNLCANWZKM4DAYAWWKPVKQYNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/action/storage_attestation","attest_author":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/action/author_attestation","sign_citation":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/action/citation_signature","submit_replication":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/action/replication_record"}},"created_at":"2026-05-18T00:04:06.590859+00:00","updated_at":"2026-05-18T00:04:06.590859+00:00"}